Sciweavers

204 search results - page 35 / 41
» Combining Static Partitioning with Dynamic Distribution of T...
Sort
View
KBSE
2007
IEEE
15 years 3 months ago
Feature location via information retrieval based filtering of a single scenario execution trace
The paper presents a semi-automated technique for feature location in source code. The technique is based on combining information from two different sources: an execution trace, ...
Dapeng Liu, Andrian Marcus, Denys Poshyvanyk, Vacl...
CP
2007
Springer
15 years 3 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
ICIW
2009
IEEE
15 years 4 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
IPSN
2004
Springer
15 years 2 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
ICDCS
2009
IEEE
15 years 6 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu