Sciweavers

141 search results - page 18 / 29
» Explicitly Parallel Regular Expressions
Sort
View
AIM
2000
13 years 7 months ago
Probabilistic Algorithms in 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
CACM
2002
92views more  CACM 2002»
13 years 7 months 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
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CONCUR
2004
Springer
14 years 28 days ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
CISIS
2007
IEEE
13 years 7 months ago
Gridifying IBM's Generic Log Adapter to Speed-Up the Processing of Log Data
Problem determination in today's computing environments consumes between 30 and 70% of an organization’s IT resources and represents from one third to one half of their tot...
Claudi Paniagua, Fatos Xhafa, Thanasis Daradoumis