Sciweavers

256 search results - page 29 / 52
» Constraint Symmetry and Solution Symmetry
Sort
View
CAEPIA
2003
Springer
14 years 1 months ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
GMP
2000
IEEE
118views Solid Modeling» more  GMP 2000»
14 years 9 days ago
A System for Constructing Boundary Representation Solid Models from a Two-Dimensional Sketch
This paper describes a system which converts a twodimensional sketch with hidden lines removed of a single polyhedral object into a boundary representation solid model. The system...
P. A. C. Varley, Ralph R. Martin
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
14 years 4 days ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
ASPDAC
2005
ACM
85views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Integration of supercubing and learning in a SAT solver
Abstract— Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Rece...
Domagoj Babic, Alan J. Hu
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
14 years 9 days ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen