2100 search results - page 192 / 420 » Fundamentals of the problem |
109
Voted
MOBIHOC
2001
ACM
16 years 11 days ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
109
Voted
WSDM
2010
ACM
15 years 10 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
98
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
Multi-agent planning is a fundamental problem in multiagent systems that has acquired a variety of meanings in the relative literature. In this paper we focus on a setting where m...
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
— The 3-D channel routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is a 3-D grid G and the terminals are vertices of G located ...