Sciweavers

474 search results - page 83 / 95
» On Multicast Path Finding Algorithms
Sort
View
DAM
1999
128views more  DAM 1999»
13 years 7 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
SIGMETRICS
2000
ACM
145views Hardware» more  SIGMETRICS 2000»
13 years 7 months ago
The incremental deployability of RTT-based congestion avoidance for high speed TCP Internet connections
Our research focuses on end-to-end congestion avoidance algorithms that use round trip time (RTT) fluctuations as an indicator of the level of network congestion. The algorithms a...
Jim Martin, Arne A. Nilsson, Injong Rhee
SIGSOFT
2010
ACM
13 years 2 months ago
Path-based fault correlations
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
Wei Le, Mary Lou Soffa
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen