All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3

Displaying 41 – 50 of 50

Showing per page

Splitting d'opérateur pour l'équation de transport neutronique en géométrie bidimensionnelle plane

Samir Akesbi (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The aim of this work is to introduce and to analyze new algorithms for solving the transport neutronique equation in 2D geometry. These algorithms present the duplicate favors to be, on the one hand faster than some classic algorithms and easily to be implemented and naturally deviced for parallelisation on the other hand. They are based on a splitting of the collision operator holding amount of caracteristics of the transport operator. Some numerical results are given at the end of this work. ...

Towards a theory of practice in metaheuristics design: A machine learning perspective

Mauro Birattari, Mark Zlochin, Marco Dorigo (2006)

RAIRO - Theoretical Informatics and Applications

A number of methodological papers published during the last years testify that a need for a thorough revision of the research methodology is felt by the operations research community – see, for example, [Barr et al., J. Heuristics1 (1995) 9–32; Eiben and Jelasity, Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002) 582–587; Hooker, J. Heuristics1 (1995) 33–42; Rardin and Uzsoy, J. Heuristics7 (2001) 261–304]. In particular, the performance evaluation of nondeterministic methods,...

Towards the automated synthesis of a Gröbner bases algorithm.

Bruno Buchberger (2004)

RACSAM

We discuss the question of whether the central result of algorithmic Gröbner bases theory, namely the notion of S?polynomials together with the algorithm for constructing Gröbner bases using S?polynomials, can be obtained by ?artificial intelligence?, i.e. a systematic (algorithmic) algorithm synthesis method. We present the ?lazy thinking? method for theorem and algorithm invention and apply it to the ?critical pair / completion? algorithm scheme. We present a road map that demonstrates that, with...

Tuning the Zhu-Takaoka string matching algorithm and experimental results

Thomas Berry, Somasundaram Ravindran (2002)

Kybernetika

In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm and compared...

Two-variable word equations

Lucian Ilie, Wojciech Plandowski (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Two-variable word equations

Lucian Ilie, Wojciech Plandowski (2010)

RAIRO - Theoretical Informatics and Applications

We consider languages expressed by word equations in two variables and give a complete characterization for their complexity functions, that is, the functions that give the number of words of the same length. Specifically, we prove that there are only five types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizations in terms of the number of solutions of Diophantine equations of certain types. In particular,...

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...

Currently displaying 41 – 50 of 50

Previous Page 3