1753 search results - page 220 / 351 » Dynamic Scan Scheduling |
145
click to vote
ANOR
2008
15 years 3 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
108
click to vote
IJFCS
2006
15 years 3 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
119
click to vote
JUCS
2008
15 years 3 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
149
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout dynamically changing networks. We present an analysis of a gossip pro...
140
Voted
SIGCOMM
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...