Sciweavers

567 search results - page 83 / 114
» Regularized Policy Iteration
Sort
View
CACM
2002
92views more  CACM 2002»
15 years 13 days ago
Probabilistic robotics
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perceptio...
Sebastian Thrun
88
Voted
DAM
1998
77views more  DAM 1998»
15 years 8 days ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin
119
Voted
GLOBECOM
2010
IEEE
14 years 10 months ago
Cache-Based Scalable Deep Packet Inspection with Predictive Automaton
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
Yi Tang, Junchen Jiang, Xiaofei Wang, Yi Wang, Bin...
102
Voted
NAR
2011
226views Computer Vision» more  NAR 2011»
14 years 3 months ago
The International Nucleotide Sequence Database Collaboration
Under the International Nucleotide Sequence Database Collaboration (INSDC; http://www.insdc. org), globally comprehensive public domain nucleotide sequence is captured, preserved ...
Guy Cochrane, Ilene Karsch-Mizrachi, Yasukazu Naka...
115
Voted
CVPR
2009
IEEE
16 years 7 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...