Sciweavers

1937 search results - page 192 / 388
» Conditioning Probabilistic Databases
Sort
View
ISIPTA
2005
IEEE
119views Mathematics» more  ISIPTA 2005»
16 years 4 days ago
Ordinal Subjective Foundations for Finite-domain Probability Agreement
Normative study of probability-agreeing orderings of propositions, much of it rooted in a false but evocative conjecture of Bruno de Finetti, has typically sought to credal ration...
Paul Snow
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
16 years 2 days ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
CSL
2003
Springer
15 years 11 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
EUSAI
2003
Springer
15 years 11 months ago
Vision-Based Localization for Mobile Platforms
In this paper, we describe methods to localize a mobile robot in an indoor environment from visual information. An appearance-based approach is adopted in which the environment is ...
Josep M. Porta, Ben J. A. Kröse
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 11 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle