269 search results - page 13 / 54 » Complexity Theory Made Easy |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
DIS
1999
Springer
14 years 28 days ago
1999
Springer
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...
DALT
2010
Springer
13 years 3 months ago
2010
Springer
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
COMPSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...