256 search results - page 29 / 52 » Constraint Symmetry and Solution Symmetry |
159
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
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...
143
click to vote
GMP
2000
IEEE
15 years 10 months ago
2000
IEEE
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...
176
click to vote
ASIAN
1998
Springer
15 years 10 months ago
1998
Springer
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 ...
149
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
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...
163
click to vote
WDAG
2001
Springer
2001
Springer
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
15 years 10 months ago
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...