245 search results - page 35 / 49 » State Complexity of Testing Divisibility |
134
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
104
click to vote
ICALP
2009
Springer
16 years 22 days ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
115
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
107
click to vote
ICST
2008
IEEE
15 years 6 months ago
2008
IEEE
Flash memory has become virtually indispensable in most mobile devices, such as mobile phones, digital cameras, mp3 players, etc. In order for mobile devices to successfully provi...
118
Voted
BMCBI
2005
15 years 10 days ago
2005
Background: Recent advances in molecular biology techniques provide an opportunity for developing detailed mathematical models of biological processes. An iterative scheme is intr...