Sciweavers

914 search results - page 38 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IJRR
2011
218views more  IJRR 2011»
13 years 5 months ago
Motion planning under uncertainty for robotic tasks with long time horizons
Abstract Partially observable Markov decision processes (POMDPs) are a principled mathematical framework for planning under uncertainty, a crucial capability for reliable operation...
Hanna Kurniawati, Yanzhu Du, David Hsu, Wee Sun Le...
CSE
2009
IEEE
14 years 5 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer
VR
2000
IEEE
172views Virtual Reality» more  VR 2000»
14 years 2 months ago
An Intelligent User Interface with Motion Planning for 3D Navigation
Due to the rapid evolution of graphics hardware, interactive 3D graphics is becoming popular on desktop personal computers. However, it remains a challenging task for a novice use...
Tsai-Yen Li, Hung-Kai Ting
ICTAI
2002
IEEE
14 years 3 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
RECOMB
2009
Springer
14 years 5 months ago
Reconstructing Histories of Complex Gene Clusters on a Phylogeny
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
Tomás Vinar, Brona Brejová, Giltae S...