Sciweavers

1566 search results - page 91 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
ICDCS
1999
IEEE
14 years 16 days ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
ICSE
2004
IEEE-ACM
14 years 8 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
COMCOM
2008
100views more  COMCOM 2008»
13 years 8 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
ALIFE
2006
13 years 8 months ago
The Infection Algorithm: An Artificial Epidemic Approach for Dense Stereo Correspondence
We present a new bio-inspired approach applied to a problem of stereo image matching. This approach is based on an artificial epidemic process, which we call the infection algorith...
Gustavo Olague, Francisco Fernández, Cynthi...
IJSNET
2006
107views more  IJSNET 2006»
13 years 8 months ago
In-network aggregation trade-offs for data collection in wireless sensor networks
This paper explores in-network aggregation as a power-efficient mechanism for collecting data in wireless sensor networks. In particular, we focus on sensor network scenarios wher...
Ignacio Solis, Katia Obraczka