Sciweavers

2657 search results - page 266 / 532
» On the complexity of hierarchical problem solving
Sort
View
ATAL
2007
Springer
16 years 27 days 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...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
16 years 27 days ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
CIMCA
2005
IEEE
16 years 10 days ago
Cognitive Perception in RAFALE-SP Methodology
Several methodologies based on Multi-agent Systems (MAS) already exist. They help designers to describe software or to create MAS which aim at solving complex problems by simulati...
Nicolas Marilleau, Christophe Lang, Pascal Chatonn...
SAC
2005
ACM
16 years 8 days ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
INFOCOM
2003
IEEE
16 years 9 hour ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu