Sciweavers

993 search results - page 165 / 199
» The Complexity of Probabilistic EL
Sort
View
APIN
2008
305views more  APIN 2008»
13 years 7 months ago
A generalized model for financial time series representation and prediction
Abstract Traditional financial analysis systems utilize lowlevel price data as their analytical basis. For example, a decision-making system for stock predictions regards raw price...
Depei Bao
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
ENTCS
2010
96views more  ENTCS 2010»
13 years 7 months ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
IPM
2008
92views more  IPM 2008»
13 years 7 months ago
Searching strategies for the Hungarian language
This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evalu...
Jacques Savoy