Sciweavers

759 search results - page 82 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
AAAI
2000
14 years 11 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
FOCS
2002
IEEE
15 years 2 months ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
AIEDAM
2007
90views more  AIEDAM 2007»
14 years 10 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 1 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...
CGF
2008
148views more  CGF 2008»
14 years 10 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker