Sciweavers

1984 search results - page 228 / 397
» The colourful feasibility problem
Sort
View
CORR
2002
Springer
104views Education» more  CORR 2002»
15 years 7 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
IJCV
2000
164views more  IJCV 2000»
15 years 7 months ago
Probabilistic Modeling and Recognition of 3-D Objects
This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical too...
Joachim Hornegger, Heinrich Niemann
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 6 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
186
Voted
JCB
1998
105views more  JCB 1998»
15 years 6 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
MP
1998
113views more  MP 1998»
15 years 6 months ago
Generalized semi-infinite optimization: A first order optimality condition and examples
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Hubertus Th. Jongen, Jan-J. Rückmann, Oliver ...