Sciweavers

1220 search results - page 147 / 244
» Minimal Interval Completions
Sort
View
SCHEDULING
2008
97views more  SCHEDULING 2008»
13 years 8 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee
JIB
2010
85views more  JIB 2010»
13 years 7 months ago
An evaluation of the performance of three semantic background knowledge sources in comparative anatomy
In this paper we evaluate the performance and usefulness of three semantic background knowledge sources for predicting synonymous anatomical terms across species boundaries. The r...
Ernest A. A. van Ophuizen, Jack A. M. Leunissen
MICS
2010
77views more  MICS 2010»
13 years 7 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger
OL
2010
77views more  OL 2010»
13 years 7 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre
VTC
2010
IEEE
148views Communications» more  VTC 2010»
13 years 7 months ago
Association Control Based Load Balancing for Tactical Information Communication Networks
—In this paper, we propose a distributed load balancing using association control, especially for Tactical Information Communication Networks (TICNs). We develop a scheme for eff...
Kiran T. Nath, Dongmyoung Kim, Sunghyun Choi