1927 search results - page 102 / 386 » UMDAs for dynamic optimization problems |
106
click to vote
ATAL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
108
click to vote
AI
1999
Springer
15 years 12 days ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
122
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
Abstract—We study the challenging problem of strategic content placement in a dynamic MANET. Existing content placement techniques cannot cope with such network dynamics since th...
109
click to vote
TIT
2008
15 years 19 days ago
2008
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...