Sciweavers

2266 search results - page 221 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 9 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
ECCC
2008
107views more  ECCC 2008»
15 years 3 months ago
A Quantum Time-Space Lower Bound for the Counting Hierarchy
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
Dieter van Melkebeek, Thomas Watson
JAPLL
2006
97views more  JAPLL 2006»
15 years 3 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 7 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
TACAS
2010
Springer
241views Algorithms» more  TACAS 2010»
15 years 10 months ago
Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
Matthieu Moy, Karine Altisen