16091 search results - page 114 / 3219 » Solving |
FLAIRS
2006
13 years 10 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
IAAI
2001
13 years 10 months ago
2001
For the last 10 years, airlines have widely supported research on the development of airspaces where aircraft would be free to decide their trajectory: these areas where called Fr...
IADIS
2003
13 years 10 months ago
2003
In an audience driven approach to website design, the requirements of the different audiences are modeled as separated tiny conceptual schemas comparable to views. This has severa...
UAI
2001
13 years 10 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
UAI
2004
13 years 10 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...