1662 search results - page 134 / 333 » The Computational Complexity of Agent Design Problems |
169
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
136
Voted
VLSID
1999
IEEE
15 years 8 months ago
1999
IEEE
Formal approaches to HW and system design have not been generally adopted, because designers often view the modelling concepts in these approaches as unsuitable for their problems...
136
Voted
GPEM
2008
15 years 3 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
154
Voted
CSB
2005
IEEE
15 years 9 months ago
2005
IEEE
Scientists face an ever-increasing challenge in investigating biological systems with high throughput experimental methods such as mass spectrometry and gene arrays because of the...
118
Voted
AAAI
2006
15 years 5 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...