1927 search results - page 22 / 386 » UMDAs for dynamic optimization problems |
109
Voted
EAAI
2007
15 years 13 days ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...
112
click to vote
MP
2006
15 years 13 days ago
2006
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...
114
click to vote
SIAMCO
2002
15 years 4 days ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
DEBU
2000
15 years 9 days ago
2000
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
108
click to vote
ESA
1997
Springer
15 years 4 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...