359 search results - page 49 / 72 » Using graph analysis to study networks of adaptive agent |
QSHINE
2005
IEEE
14 years 1 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
ADHOC
2007
13 years 7 months ago
2007
The phenomenal growth in wireless technologies has brought about a slew of new services. Incumbent with the new technology is the challenge of providing flexible, reconfigurable...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
The structure of customer communication network provides us a natural way to understand customers’ relationships. Traditional customer relationship management (CRM) methods focu...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...