Sciweavers

6568 search results - page 937 / 1314
» Reducing the Complexity of Reductions
Sort
View
AADEBUG
2005
Springer
16 years 12 days ago
Automated bug isolation via program chipping
This paper introduces program chipping, a simple yet effective technique to isolate bugs. This technique automatically removes or chips away parts of a program so that the part t...
Chad D. Sterling, Ronald A. Olsson
MDM
2005
Springer
165views Communications» more  MDM 2005»
16 years 10 days ago
STEP: Self-Tuning Energy-safe Predictors
Data access prediction has been proposed as a mechanism to overcome latency lag, and more recently as a means of conserving energy in mobile systems. We present a fully adaptive p...
James Larkby-Lahet, Ganesh Santhanakrishnan, Ahmed...
ADHOCNOW
2004
Springer
16 years 8 days ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 7 days ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
HSNMC
2004
Springer
121views Multimedia» more  HSNMC 2004»
16 years 7 days ago
RBU+: Recursive Binding Update for End-to-End Route Optimization in Nested Mobile Networks
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is ...
Ho-sik Cho, Eun Kyoung Paik, Yanghee Choi