1814 search results - page 42 / 363 » Improved Results on Geometric Hitting Set Problems |
FLAIRS
2000
13 years 10 months ago
2000
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
AUTOMATICA
2007
13 years 9 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
We present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It is the first method which performs a multiple alig...
CCCG
1993
13 years 10 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
DAC
2005
ACM
14 years 10 months ago
2005
ACM
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...