Sciweavers

9842 search results - page 1285 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
16 years 1 months ago
Probabilistic Appearance Based Navigation and Loop Closing
— This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of appearance, we can compute not only the similarity o...
Mark Cummins, Paul M. Newman
ICTAI
2007
IEEE
16 years 1 months ago
Assessing Hierarchical Cooperative CoEvolution
Recently, many research efforts are directed towards coevolutionary algorithms. The present work aims at the assessment of Hierarchical Cooperative CoEvolution (HCCE) being proper...
Michail Maniadakis, Panos E. Trahanias
IEEEICCI
2007
IEEE
16 years 1 months ago
A Logic Language of Granular Computing
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...
Yiyu Yao, Bing Zhou
IPPS
2007
IEEE
16 years 1 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
IROS
2007
IEEE
125views Robotics» more  IROS 2007»
16 years 1 months ago
Probabilistic inference for structured planning in robotics
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...
Marc Toussaint, Christian Goerick
« Prev « First page 1285 / 1969 Last » Next »