874 search results - page 30 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
ESA
2006
Springer
15 years 1 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...
CHARME
2001
Springer
15 years 1 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
CLUSTER
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
105
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...