Sciweavers

2194 search results - page 55 / 439
» Improving HLRTA*( k )
Sort
View
INFORMS
2008
62views more  INFORMS 2008»
13 years 11 months ago
Edge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten's edge finder for cumulative schedu...
Luc Mercier, Pascal Van Hentenryck
SECON
2010
IEEE
13 years 9 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
SIAMNUM
2010
115views more  SIAMNUM 2010»
13 years 5 months ago
Superconvergence of Discontinuous Galerkin and Local Discontinuous Galerkin Schemes for Linear Hyperbolic and Convection-Diffusi
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
Yingda Cheng, Chi-Wang Shu
TCS
2012
12 years 6 months ago
Better short-seed quantum-proof extractors
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
Avraham Ben-Aroya, Amnon Ta-Shma
ALGOSENSORS
2009
Springer
14 years 5 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal