Sciweavers

14739 search results - page 197 / 2948
» An optimization problem on the sphere
Sort
View
ICTAI
1996
IEEE
15 years 3 months ago
Applying a Mutation-based Genetic Algorithm to Processor Configuration Problems
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
T. L. Lau, Edward P. K. Tsang
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 3 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
15 years 2 months ago
GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
Peter Lichodzijewski, Malcolm I. Heywood
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
15 years 2 months ago
GP+Echo+Subsumption = Improved Problem Solving
Real-time, adaptive control is a difficult problem that can be addressed by EC architectures. We are interested in incorporating into an EC architecture some of the features that ...
William F. Punch, W. M. Rand
ECAI
2010
Springer
15 years 1 days ago
LP Solvable Models for Multiagent Fair Allocation Problems
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
Julien Lesca, Patrice Perny