Sciweavers

1110 search results - page 153 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
CEC
2008
IEEE
15 years 5 months ago
High-level synthesis with multi-objective genetic algorithm: A comparative encoding analysis
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
Christian Pilato, Daniele Loiacono, Fabrizio Ferra...
ATAL
2006
Springer
15 years 2 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
AIPS
2006
15 years 11 days ago
Incremental Scheduling to Maximize Quality in a Dynamic Environment
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
Anthony Gallagher, Terry L. Zimmerman, Stephen F. ...
CPHYSICS
2010
135views more  CPHYSICS 2010»
14 years 11 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 2 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky