Sciweavers

2767 search results - page 243 / 554
» Universal Exponentiation Algorithm
Sort
View
117
Voted
ATAL
2006
Springer
15 years 6 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
123
Voted
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
125
Voted
AAAI
2004
15 years 4 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
134
Voted
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 2 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
131
Voted
JMLR
2010
137views more  JMLR 2010»
14 years 9 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton