Sciweavers

1814 search results - page 63 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
LPNMR
2004
Springer
14 years 2 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
14 years 1 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
14 years 2 months ago
Performance assessment of an artificial immune system multiobjective optimizer by two improved metrics
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
Maoguo Gong, Licheng Jiao, Haifeng Du, Ronghua Sha...
ICIP
2008
IEEE
14 years 3 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag