952 search results - page 69 / 191 » Computational complexity of stochastic programming problems |
88
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
93
Voted
AAAI
2007
15 years 2 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
109
Voted
CVPR
2007
IEEE
15 years 7 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...