13 search results - page 3 / 3 » A Lower Bound on the Size of Decomposable Negation Normal Fo... |
TON
2008
13 years 5 months ago
2008
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
IEAAIE
1994
Springer
13 years 9 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...