Sciweavers

14165 search results - page 297 / 2833
» The generalized two-server problem
Sort
View
CSL
2009
Springer
16 years 1 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer
CEC
2008
IEEE
16 years 1 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 24 days ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
16 years 24 days ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
CONEXT
2006
ACM
16 years 18 days ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...