Sciweavers

2354 search results - page 159 / 471
» Assignment Problems
Sort
View
142
Voted
ISCAPDCS
2007
15 years 6 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
145
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 11 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ICPR
2004
IEEE
16 years 6 months ago
Probabilistic Classification Between Foreground Objects and Background
Tracking of deformable objects like humans is a basic operation in many surveillance applications. Objects are detected as they enter the field of view of the camera and they are ...
Paul J. Withagen, Klamer Schutte, Frans C. A. Groe...
AINA
2007
IEEE
15 years 11 months ago
Extracting Significant Phrases from Text
Prospective readers can quickly determine whether a document is relevant to their information need if the significant phrases (or keyphrases) in this document are provided. Althou...
Yuan J. Lui, Richard Brent, Ani Calinescu
ICALP
2007
Springer
15 years 11 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret