14158 search results - page 172 / 2832 » Generalized switch-setting problems |
113
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
133
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
113
Voted
MMMACNS
2001
Springer
15 years 8 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
135
Voted
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
122
Voted
BIRTHDAY
1994
Springer
15 years 7 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...