Sciweavers

257 search results - page 36 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
ATAL
2010
Springer
14 years 9 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
73
Voted
CP
1997
Springer
15 years 1 months ago
Random Constraint Satisfaction: A More Accurate Picture
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...
SASO
2010
IEEE
14 years 7 months ago
Optimal Decentralized Formation of k-Member Partnerships
To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of th...
Anna Chmielowiec, Maarten van Steen
CPHYSICS
2006
182views more  CPHYSICS 2006»
14 years 9 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris