Sciweavers

698 search results - page 118 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
GECCO
2010
Springer
193views Optimization» more  GECCO 2010»
14 years 1 months ago
Fitness-AUC bandit adaptive strategy selection vs. the probability matching one within differential evolution: an empirical comp
The choice of which of the available strategies should be used within the Differential Evolution algorithm for a given problem is not trivial, besides being problem-dependent and...
Álvaro Fialho, Marc Schoenauer, Michè...
DAC
1999
ACM
14 years 1 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
EWCBR
2008
Springer
13 years 10 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
14 years 1 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
14 years 2 months ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...