1404 search results - page 156 / 281 » Optimization problems in multiple-interval graphs |
106
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...
125
click to vote
AAAI
2000
15 years 4 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
191
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
113
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
115
click to vote
4OR
2010
15 years 3 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...