Sciweavers

4666 search results - page 870 / 934
» Equations on Timed Languages
Sort
View
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
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...
Robert Krauthgamer, James R. Lee
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling with Bounded Migration
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...
Peter Sanders, Naveen Sivadasan, Martin Skutella
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 1 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter
CP
2003
Springer
14 years 29 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
CP
2003
Springer
14 years 29 days ago
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
Christophe Lecoutre, Frédéric Bousse...