Sciweavers

197 search results - page 33 / 40
» Complexity of Max-SAT using stochastic algorithms
Sort
View
JAIR
2006
101views more  JAIR 2006»
14 years 9 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 4 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
ECAI
2010
Springer
14 years 10 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 1 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
ATAL
2007
Springer
15 years 3 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...