Sciweavers

2266 search results - page 261 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
110
Voted
BIRTHDAY
2008
Springer
15 years 5 months ago
Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
Oded Maler, Dejan Nickovic, Amir Pnueli
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 7 months ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 9 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
124
Voted
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 3 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
MOC
2002
121views more  MOC 2002»
15 years 3 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge