2168 search results - page 263 / 434 » Randomized Algorithms and Complexity Theory |
119
Voted
TALG
2008
15 years 3 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
153
click to vote
SOFSEM
2012
Springer
13 years 11 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
106
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...
142
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
134
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...