Sciweavers

4201 search results - page 144 / 841
» Interaction graphs: Additives
Sort
View
ICTAI
2008
IEEE
15 years 11 months ago
FIP: A Fast Planning-Graph-Based Iterative Planner
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
Jicheng Fu, Farokh B. Bastani, Vincent Ng, I-Ling ...
128
Voted
ECAI
2000
Springer
15 years 9 months ago
Graph Based Representation of Dynamic Planning
Dynamic planning concerns the planning and execution of actions in a dynamic, real world environment. Its goal is to take into account changes generated by unpredicted events occur...
Pavlos Moraitis, Alexis Tsoukiàs
ISCAPDCS
2007
15 years 6 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
DM
2008
63views more  DM 2008»
15 years 4 months ago
Nomadic decompositions of bidirected complete graphs
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
Daniel W. Cranston
CGF
2010
99views more  CGF 2010»
15 years 4 months ago
Understanding Interactive Legends: a Comparative Evaluation with Standard Widgets
Interactive information visualization systems rely on widgets to allow users to interact with the data and modify the representation. We define interactive legends as a class of c...
Nathalie Henry Riche, Bongshin Lee, Catherine Plai...