Sciweavers

2095 search results - page 394 / 419
» Improved pebbling bounds
Sort
View
IPSN
2007
Springer
14 years 4 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
SPIN
2007
Springer
14 years 4 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
14 years 4 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
GMP
2006
IEEE
14 years 3 months ago
Subdivision Termination Criteria in Subdivision Multivariate Solvers
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
Iddo Hanniel, Gershon Elber
INFOCOM
2006
IEEE
14 years 3 months ago
Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network
Abstract— In label-switched networks such as MPLS, protection routing involves computing and setting up the backup paths at the same time when the primary paths are routed. It ha...
Faisal Aslam, Saqib Raza, Zartash Afzal Uzmi, Youn...