Sciweavers

1603 search results - page 216 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
ICPR
2006
IEEE
16 years 7 months ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano
GECCO
2010
Springer
181views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolving neural networks in compressed weight space
We propose a new indirect encoding scheme for neural networks in which the weight matrices are represented in the frequency domain by sets of Fourier coefficients. This scheme exp...
Jan Koutnik, Faustino J. Gomez, Jürgen Schmid...
AAAI
2004
15 years 7 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields
ISCAPDCS
2004
15 years 7 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
IJCAI
2003
15 years 7 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...