Sciweavers

693 search results - page 55 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
LSSC
2005
Springer
15 years 11 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 11 months ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
PPSN
2010
Springer
15 years 4 months ago
First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...
Gabriela Ochoa, Sébastien Vérel, Mar...
ACG
2009
Springer
16 years 18 days ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
16 years 4 days ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn