3563 search results - page 538 / 713 » Scheduling Algorithms for Procrastinators |
133
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
148
Voted
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
The implementation of bounded-delay services over integrated services networks relies admission control mechanisms that in turn use end-to-end delay computation algorithms. For gu...
148
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
145
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
149
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...