2657 search results - page 176 / 532 » On the complexity of hierarchical problem solving |
120
click to vote
CP
1998
Springer
15 years 6 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
There are already a huge number of problems for silicon designers and it is likely to just get worse. Many of these problems are technical associated with shrinking geometries and...
113
click to vote
WSC
2008
15 years 4 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
105
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
106
click to vote
AI
2006
Springer
15 years 5 months ago
2006
Springer
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may c...