Sciweavers

14548 search results - page 313 / 2910
» The Optimal Path-Matching Problem
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
ICTAI
1996
IEEE
15 years 10 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 10 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 10 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 10 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