Sciweavers

914 search results - page 111 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
STORYTELLING
2007
Springer
15 years 6 months ago
Wide Ruled: A Friendly Interface to Author-Goal Based Story Generation
We present Wide Ruled, an authoring tool for the creation of generative stories. It is based on the Universe author-goal-based model of story generation, and extends this model by ...
James Skorupski, Lakshmi Jayapalan, Sheena Marquez...
ZUM
2000
Springer
132views Formal Methods» more  ZUM 2000»
15 years 3 months ago
A Formal Architecture for the 3APL Agent Programming Language
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
Mark d'Inverno, Koen V. Hindriks, Michael Luck
IPMI
2007
Springer
16 years 21 days ago
Bayesian Tracking of Elongated Structures in 3D Images
Tracking of tubular elongated structures is an important goal in a wide range of biomedical imaging applications. A Bayesian tube tracking algorithm is presented that allows to eas...
Michiel Schaap, Ihor Smal, Coert Metz, Theo van Wa...
ICRA
2008
IEEE
149views Robotics» more  ICRA 2008»
15 years 6 months ago
Single camera vision-only SLAM on a suburban road network
—Simultaneous Localization And Mapping (SLAM) is one of the major challenges in mobile robotics. Probabilistic techniques using high-end range finding devices are well establishe...
Michael Milford, Gordon Wyeth
MFCS
2007
Springer
15 years 6 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner