Sciweavers

895 search results - page 124 / 179
» Using graphs for some discrete tomography problems
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
14 years 10 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
PUK
2001
14 years 11 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
FUIN
2010
112views more  FUIN 2010»
14 years 8 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Luca Pulina, Armando Tacchella
SMI
2007
IEEE
208views Image Analysis» more  SMI 2007»
15 years 4 months ago
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
Yi-Ling Chen, Shang-Hong Lai