Sciweavers

EPS
1998
Springer
14 years 4 hour ago
Local Selection
Filippo Menczer, Richard K. Belew
EPS
1998
Springer
14 years 4 hour ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
EPS
1998
Springer
14 years 4 hour ago
GA-Optimal Fitness Functions
Joseph L. Breeden
EPS
1998
Springer
14 years 4 hour ago
Sex, Mate Selection, and Evolution
: Simulations of the evolution of populations of diploid organisms showed that mate selection strategies which selected for "good genes" and strategies based on assortati...
Klaus Jaffe
EPS
1998
Springer
14 years 4 hour ago
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathi...
EPS
1998
Springer
14 years 4 hour ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield
EPS
1998
Springer
14 years 4 hour ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
ECAI
1998
Springer
14 years 6 hour ago
A Knowledge-theoretic Approach to Distributed Problem Solving
Traditional approaches to distributed problem solving have treated the problem as one of distributed search. In this paper, we propose an alternative, logic-based view of distribut...
Michael Wooldridge
ECAI
1998
Springer
14 years 6 hour ago
Algebraic Topology for Knowledge Representation in Analogy Solving
We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the anal...
Erika Valencia, Jean-Louis Giavitto, Jean-Paul San...
ECAI
1998
Springer
14 years 6 hour ago
The Intentions of Teams: Team Structure, Endodeixis, and Exodeixis
Abstract. Teams arise in a number of important multiagent applications. Several theories of intentions for teams have been proposed. By and large, these theories tend to model team...
Munindar P. Singh