Sciweavers

728 search results - page 84 / 146
» Compressing combinatorial objects
Sort
View
COMPGEOM
2007
ACM
15 years 4 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
90
Voted
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 4 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
93
Voted
IJCAI
2003
15 years 2 months ago
Scenario-based Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
Suresh Manandhar, Armagan Tarim, Toby Walsh
141
Voted
AAAI
1994
15 years 1 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
129
Voted
CGF
2010
135views more  CGF 2010»
15 years 22 days ago
Designing Quad-dominant Meshes with Planar Faces
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...