Sciweavers

270 search results - page 32 / 54
» Programming with Intervals
Sort
View
ICALP
2005
Springer
14 years 8 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
IFIP
2003
Springer
13 years 12 months ago
Enhanced Power Saving Scheme for IEEE 802.11 DCF Based Wireless Networks
Abstract. Providing energy efficiency in MAC (Medium Access Control) layer, while achieving desirable throughput, is an important research issue in the area of wireless networking....
Jong-Mu Choi, Young-Bae Ko, Jai-Hoon Kim
RTSS
1995
IEEE
13 years 10 months ago
Enhancing Real-Time Schedules to Tolerate Transient Faults
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
Sunondo Ghosh, Rami G. Melhem, Daniel Mossé
AAAI
1994
13 years 8 months ago
Cost-Effective Sensing during Plan Execution
Between sensing the world after every action (as in a reactive plan) and not sensing at all (as in an openloop plan), lies a continuum of strategies for sensing during plan execut...
Eric A. Hansen
CPAIOR
2009
Springer
13 years 7 months ago
Max Energy Filtering Algorithm for Discrete Cumulative Resources
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
Petr Vilím