Sciweavers

17760 search results - page 147 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
AAAI
2008
15 years 6 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
161
Voted
GECCO
2007
Springer
217views Optimization» more  GECCO 2007»
15 years 5 months ago
A quantitative analysis of memory requirement and generalization performance for robotic tasks
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...
DaeEun Kim
NIPS
2007
15 years 5 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
ADCM
2006
54views more  ADCM 2006»
15 years 4 months ago
Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix
In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space Wk p (Rs )(1 p ) to a vector refinement equation with a general dil...
Bin Han 0003
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 4 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi