Sciweavers

16404 search results - page 371 / 3281
» A set coverage problem
Sort
View
TOG
2002
109views more  TOG 2002»
15 years 5 months ago
Level set surface editing operators
We present a level set framework for implementing editing operators for surfaces. Level set models are deformable implicit surfaces where the deformation of the surface is control...
Ken Museth, David E. Breen, Ross T. Whitaker, Alan...
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
15 years 7 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan
AMC
2010
65views more  AMC 2010»
15 years 6 months ago
On conjugate points and the Leitmann equivalent problem approach
This article extends the Leitmann equivalence method to a class of problems featuring conjugate points. The class is characterised by the requirement that the set of indifference ...
F. O. O. Wagener
EOR
2008
85views more  EOR 2008»
15 years 6 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
EOR
2006
104views more  EOR 2006»
15 years 6 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve