Sciweavers

9572 search results - page 426 / 1915
» Cover Algorithms and Their Combination
Sort
View
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
JOIN
2007
133views more  JOIN 2007»
15 years 6 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo
MP
2007
95views more  MP 2007»
15 years 6 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
SAC
2008
ACM
15 years 6 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
WG
2010
Springer
15 years 5 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang