120
click to vote
ICALP
15 years 5 months ago
2004 Springer 
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
112
click to vote
ICALP
15 years 5 months ago
2004 Springer 
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
107
click to vote
ICALP
15 years 5 months ago
2004 Springer 
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
104
click to vote
ICALP
15 years 5 months ago
2004 Springer 
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
104
click to vote
ICALP
15 years 5 months ago
2004 Springer 
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
|
Programming Languages