2474 search results - page 149 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
148
Voted
JMLR
2006
15 years 5 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
141
Voted
JMLR
2006
15 years 5 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
137
click to vote
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
158
click to vote
HIPC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
131
Voted
4OR
2006
15 years 5 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...