Sciweavers

727 search results - page 99 / 146
» Private approximation of search problems
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 4 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 4 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
ECCV
2010
Springer
14 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
ATAL
2008
Springer
13 years 12 months ago
Dynamics based control with PSRs
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
Ariel Adam, Zinovi Rabinovich, Jeffrey S. Rosensch...