Sciweavers

2621 search results - page 451 / 525
» Generalized Algorithms for Constructing Statistical Language...
Sort
View
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 7 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
BMCBI
2006
180views more  BMCBI 2006»
13 years 7 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis
DAC
2012
ACM
11 years 10 months ago
Equivalence checking for behaviorally synthesized pipelines
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
Kecheng Hao, Sandip Ray, Fei Xie