2244 search results - page 197 / 449 » A new heuristic approach for non-convex optimization problem... |
212
click to vote
IJCAI
2007
15 years 8 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
241
click to vote
ISAAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
197
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
191
click to vote
EVOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
202
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...