3455 search results - page 423 / 691 » Generalized Game Trees |
138
click to vote
SPIRE
2004
Springer
16 years 1 days ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
167
click to vote
GCB
1997
Springer
15 years 10 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
187
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
195
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
171
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...