Sciweavers

2845 search results - page 357 / 569
» Constraints over Ontologies
Sort
View
ICRA
2010
IEEE
95views Robotics» more  ICRA 2010»
13 years 9 months ago
Optimizing coordinate choice for locomoting systems
Abstract— Gait evaluation techniques that use Stokes’s theorem to integrate a system’s equations of motion have traditionally been limited to finding only the net rotations ...
Ross L. Hatton, Howie Choset
ICRA
2010
IEEE
123views Robotics» more  ICRA 2010»
13 years 9 months ago
Robotic motion planning in dynamic, cluttered, uncertain environments
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...
Noel E. Du Toit, Joel W. Burdick
ISVD
2010
IEEE
13 years 8 months ago
Fast Dynamic Voronoi Treemaps
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
Avneesh Sud, Danyel Fisher, Huai-Ping Lee
JSS
2010
215views more  JSS 2010»
13 years 8 months ago
Analyzing architectural styles
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...
Jung Soo Kim, David Garlan
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 8 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani