Sciweavers

1792 search results - page 148 / 359
» Improved scheduling in rings
Sort
View
LATIN
2010
Springer
15 years 4 months ago
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
102
Voted
PIMRC
2010
IEEE
14 years 9 months ago
Joint channel assignment and link scheduling for wireless mesh networks: Revisiting the Partially Overlapped Channels
Despite all the encouraging reports on the benefit of Partially Overlapped Channels (POCs), the relative simple interference models and rather arbitrary network settings considered...
Xiang Liu, Jun Luo
ECRTS
2007
IEEE
15 years 5 months ago
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
Björn B. Brandenburg, James H. Anderson
HPDC
2000
IEEE
15 years 3 months ago
Managing Network Resources in Condor
Data-intensive applications in the Condor High Throughput Computing environment can place heavy demands on network resources for checkpointing and remote data access. We have deve...
Jim Basney, Miron Livny
AIPS
2008
15 years 1 months ago
A New Local Search for the Job Shop Problem with Uncertain Durations
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
Inés González Rodríguez, Cami...