Sciweavers

42230 search results - page 8 / 8446
» Algorithms and Complexity Results for
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
DAM
1999
119views more  DAM 1999»
13 years 7 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
AAAI
1996
13 years 8 months ago
A Kernel-Oriented Model for Coalition-Formation in General Environments: Implementation and Results
In this paper we present a model for coalition formation and payo distribution in general environments. We focus on a reduced complexity kernel-oriented coalition formation model,...
Onn Shehory, Sarit Kraus
DAM
2006
88views more  DAM 2006»
13 years 7 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden