Sciweavers

227 search results - page 9 / 46
» Rough Set Methods in Approximation of Hierarchical Concepts
Sort
View
IROS
2007
IEEE
188views Robotics» more  IROS 2007»
14 years 1 months ago
Behavior maps for online planning of obstacle negotiation and climbing on rough terrain
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...
Christian Dornhege, Alexander Kleiner
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
14 years 2 months ago
On the approximate domain optimization of deterministic and expected value criteria
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
RSCTC
2004
Springer
237views Fuzzy Logic» more  RSCTC 2004»
14 years 1 months ago
An Automated Multi-spectral MRI Segmentation Algorithm Using Approximate Reducts
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
Sebastian Widz, Kenneth Revett, Dominik Slezak
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...