187 search results - page 33 / 38 » Coloring linear orders with Rado's partial order |
ICFEM
2009
Springer
14 years 1 months ago
2009
Springer
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
DAGSTUHL
2008
13 years 8 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
SODA
2001
ACM
13 years 8 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 ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
—Patch-based face recognition is a recent method which uses the idea of analyzing face images locally, in order to reduce the effects of illumination changes and partial occlusio...