Sciweavers

4926 search results - page 600 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
125
Voted
GPEM
2008
128views more  GPEM 2008»
15 years 2 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
103
Voted
BMVC
2002
15 years 5 months ago
Low Density Feature Point Matching for Articulated Pose Identification
We describe a general algorithm for identifying an arbitrary pose of an articulated subject with low density feature points. The algorithm aims to establish a one-to-one correspon...
Horst Holstein, Baihua Li
123
Voted
WINE
2007
Springer
126views Economy» more  WINE 2007»
15 years 8 months ago
A Theory of Loss-Leaders: Making Money by Pricing Below Cost
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Cha...
125
Voted
CVPR
2012
IEEE
13 years 5 months ago
Bilevel sparse coding for coupled feature spaces
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
Jianchao Yang, Zhaowen Wang, Zhe Lin, Xianbiao Shu...
PPSN
2004
Springer
15 years 8 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong