Sciweavers

2657 search results - page 482 / 532
» On the complexity of hierarchical problem solving
Sort
View
AGENTS
2001
Springer
14 years 1 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
EXPERT
1998
86views more  EXPERT 1998»
13 years 9 months ago
IMACS: A Case Study in Real-World Planning
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
Satyandra K. Gupta, Dana S. Nau, William C. Regli
TCAD
2010
136views more  TCAD 2010»
13 years 4 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris
P2P
2007
IEEE
113views Communications» more  P2P 2007»
14 years 3 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi