Sciweavers

GECCO
2011
Springer
346views Optimization» more  GECCO 2011»
13 years 3 months ago
Evolving relationships between social networks and stakeholder involvement in software projects
Software projects often fail because stakeholder communication and involvement are inadequate. This paper proposes a novel method to understand project social networks and their c...
Soo Ling Lim, Peter J. Bentley
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
13 years 3 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
GECCO
2011
Springer
216views Optimization» more  GECCO 2011»
13 years 3 months ago
Tag-based modules in genetic programming
Lee Spector, Brian Martin, Kyle Harrington, Thomas...
GECCO
2011
Springer
256views Optimization» more  GECCO 2011»
13 years 3 months ago
Evolving complete robots with CPPN-NEAT: the utility of recurrent connections
This paper extends prior work using Compositional Pattern Producing Networks (CPPNs) as a generative encoding for the purpose of simultaneously evolving robot morphology and contr...
Joshua E. Auerbach, Josh C. Bongard
GECCO
2011
Springer
224views Optimization» more  GECCO 2011»
13 years 3 months ago
Mirrored sampling in evolution strategies with weighted recombination
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
13 years 3 months ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
13 years 3 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
EOR
2011
140views more  EOR 2011»
13 years 4 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
EOR
2011
106views more  EOR 2011»
13 years 4 months ago
Probability of unique integer solution to a system of linear equations
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer:...
O. L. Mangasarian, Benjamin Recht