250 search results - page 37 / 50 » Fixed Argument Pairings |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
PICS
2003
13 years 11 months ago
2003
An ongoing web-based color naming experiment † has collected a small number of unconstrained color names from a large number of observers. This has resulted in a large database ...
ATMOS
2009
13 years 11 months ago
2009
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train...
CVIU
2010
13 years 10 months ago
2010
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...
GC
2008
Springer
13 years 10 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...