Sciweavers

294 search results - page 31 / 59
» Bayesian Heuristic Approach to Scheduling
Sort
View
AIR
2004
130views more  AIR 2004»
13 years 10 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
TMC
2010
167views more  TMC 2010»
13 years 4 months ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
CVPR
2009
IEEE
14 years 1 months ago
Robust unsupervised segmentation of degraded document images with topic models
Segmentation of document images remains a challenging vision problem. Although document images have a structured layout, capturing enough of it for segmentation can be difficult....
Timothy J. Burns, Jason J. Corso
IPPS
2003
IEEE
14 years 3 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
MIDDLEWARE
2007
Springer
14 years 4 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta