Sciweavers

10608 search results - page 585 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AIPS
2009
15 years 8 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
CORR
2007
Springer
118views Education» more  CORR 2007»
15 years 7 months ago
Discriminated Belief Propagation
— Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of fu...
Uli Sorger
MP
2008
129views more  MP 2008»
15 years 7 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
PRL
2006
225views more  PRL 2006»
15 years 7 months ago
A straight line detection using principal component analysis
A straight line detection algorithm is presented. The algorithm separates row and column edges from edge image using their primitive shapes. The edges are labeled, and the princip...
Yun-Seok Lee, Han-Suh Koo, Chang-Sung Jeong
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
15 years 7 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...