3758 search results - page 479 / 752 » A Complete Subsumption Algorithm |
176
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
175
click to vote
EURONGI
2006
Springer
15 years 10 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
136
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
168
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...