Sciweavers

835 search results - page 143 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
FLAIRS
2008
13 years 10 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
VLDB
2005
ACM
116views Database» more  VLDB 2005»
14 years 1 months ago
Client Assignment in Content Dissemination Networks for Dynamic Data
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...
Shetal Shah, Krithi Ramamritham, Chinya V. Ravisha...
DAC
2004
ACM
13 years 11 months ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor