Sciweavers

89 search results - page 14 / 18
» Action-Space Partitioning for Planning
Sort
View
IJRR
2010
114views more  IJRR 2010»
13 years 5 months ago
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
Anna Yershova, Swati Jain, Steven M. LaValle, Juli...
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 7 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
SIGMOD
2004
ACM
122views Database» more  SIGMOD 2004»
14 years 6 months ago
Adapting to Source Properties in Processing Data Integration Queries
An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' propertie...
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
14 years 29 days ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 5 days ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang