Sciweavers

112 search results - page 21 / 23
» Using CBR to Select Solution Strategies in Constraint Progra...
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 3 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CONEXT
2010
ACM
13 years 6 months ago
Optimal content placement for a large-scale VoD system
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
13 years 8 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
VEE
2009
ACM
172views Virtualization» more  VEE 2009»
14 years 3 months ago
Entropy: a consolidation manager for clusters
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
Fabien Hermenier, Xavier Lorca, Jean-Marc Menaud, ...
CEC
2009
IEEE
14 years 3 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben