Sciweavers

1930 search results - page 19 / 386
» Learning to Solve QBF
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICMI
2010
Springer
129views Biometrics» more  ICMI 2010»
13 years 5 months ago
Quantifying group problem solving with stochastic analysis
Quantifying the relationship between group dynamics and group performance is a key issue of increasing group performance. In this paper, we will discuss how group performance is r...
Wen Dong, Alex Pentland
ICML
2006
IEEE
14 years 8 months ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey
ESANN
2007
13 years 9 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil