Sciweavers

1984 search results - page 237 / 397
» Variable mesh optimization for continuous optimization probl...
Sort
View
187
Voted
CGF
2008
126views more  CGF 2008»
15 years 6 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
CGF
2006
106views more  CGF 2006»
15 years 6 months ago
Silhouette Extraction in Hough Space
Object-space silhouette extraction is an important problem in fields ranging from non-photorealistic computer graphics to medical robotics. We present an efficient silhouette extr...
Matt Olson, Hao Zhang 0002
155
Voted
DISOPT
2008
78views more  DISOPT 2008»
15 years 6 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
190
Voted
AI
2008
Springer
15 years 6 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
COR
2007
106views more  COR 2007»
15 years 5 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...