Sciweavers

800 search results - page 113 / 160
» On the Complexity of Parity Games
Sort
View
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
14 years 22 days ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...
AIPS
2009
13 years 10 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
CE
2006
161views more  CE 2006»
13 years 9 months ago
Applying an authentic, dynamic learning environment in real world business
This paper describes a dynamic computer-based business learning environment and the results from applying it in a real-world business organization. We argue for using learning too...
Timo Lainema, Sami Nurmi
IAT
2006
IEEE
14 years 3 months ago
Dynamic Service Composition and Selection through an Agent Interaction Protocol
This paper addresses the dynamic service selection and composition issues for the satisfaction of user requirements. We propose an approach in which agents perform service composi...
Yasmine Charif-Djebbar, Nicolas Sabouret
SIGCSE
2005
ACM
180views Education» more  SIGCSE 2005»
14 years 2 months ago
Analyze that: puzzles and analysis of algorithms
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...
Anany Levitin