Sciweavers

438 search results - page 83 / 88
» New Search Heuristics for Max-CSP
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
IAT
2005
IEEE
15 years 3 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
HOTOS
2007
IEEE
15 years 1 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou
AIIDE
2008
14 years 12 months ago
Automatic Generation of Game Level Solutions as Storyboards
Interactive Storytelling techniques are attracting much interest for their potential to develop new game genres but also as another form of procedural content generation, specific...
David Pizzi, Marc Cavazza, Alex Whittaker, Jean-Lu...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf