Sciweavers

1883 search results - page 155 / 377
» Ordered theta graphs
Sort
View
ACMACE
2008
ACM
13 years 10 months ago
Extracting camera-control requirements and camera movement generation in a 3D virtual environment
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
Hirofumi Hamazaki, Shinya Kitaoka, Maya Ozaki, Yos...
GRID
2008
Springer
13 years 8 months ago
ADL: An Algorithm Definition Language for SmartGridSolve
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
Michele Guidolin, Alexey L. Lastovetsky
FUIN
2007
95views more  FUIN 2007»
13 years 8 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 6 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
EJC
2011
13 years 3 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer