Sciweavers

6274 search results - page 640 / 1255
» From query complexity to computational complexity
Sort
View
ATAL
1997
Springer
15 years 11 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 11 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 11 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 11 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
DSD
2006
IEEE
131views Hardware» more  DSD 2006»
15 years 11 months ago
Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip
Abstract-- Networks-on-Chip will serve as the central integration platform in future complex SoC designs, composed of a large number of heterogeneous processing resources. Most res...
Christian Neeb, Norbert Wehn