Sciweavers

169 search results - page 26 / 34
» A Mathematical Programming Model For A Timetabling Problem
Sort
View
NIPS
1994
14 years 11 months ago
Using a neural net to instantiate a deformable model
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...
Christopher K. I. Williams, Michael Revow, Geoffre...
ICALP
1992
Springer
15 years 1 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 2 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
ASPDAC
2001
ACM
104views Hardware» more  ASPDAC 2001»
15 years 1 months ago
Optimal spacing and capacitance padding for general clock structures
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking