2168 search results - page 349 / 434 » Randomized Algorithms and Complexity Theory |
148
click to vote
ICTAI
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
144
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
153
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
108
click to vote
COCO
2008
Springer
15 years 4 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
135
click to vote
UAI
2001
15 years 4 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...