1662 search results - page 192 / 333 » The Computational Complexity of Agent Design Problems |
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
BMCBI
2010
13 years 9 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
HYBRID
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Motivated by three applications which are under investigation at the Honeywell Research Laboratory in Minneapolis, we introduce a class of large scale control problems. I...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...