Sciweavers

18306 search results - page 174 / 3662
» Algorithmics in Exponential Time
Sort
View
124
Voted
CSR
2011
Springer
14 years 1 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
82
Voted
LICS
2002
IEEE
15 years 3 months ago
Temporal Logic with Forgettable Past
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
François Laroussinie, Nicolas Markey, Ph. S...
AAAI
1994
14 years 11 months ago
Temporal Reasoning with Constraints on Fluents and Events
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Eddie Schwalb, Kalev Kask, Rina Dechter
FOGA
1994
14 years 11 months ago
Stability of Vertex Fixed Points and Applications
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the differential of th...
Michael D. Vose, Alden H. Wright
BMCBI
2006
144views more  BMCBI 2006»
14 years 10 months ago
Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
Shih-Hau Chiu, Chien-Chi Chen, Gwo-Fang Yuan, Thy-...