17760 search results - page 191 / 3552 » A Generalization of the Massey-Ding Algorithm |
158
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
170
click to vote
COMPGEOM
1996
ACM
15 years 8 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
130
click to vote
TAPSOFT
1997
Springer
15 years 8 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
123
click to vote
EKAW
2000
Springer
15 years 8 months ago
2000
Springer
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
138
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...