765 search results - page 4 / 153 » Empirical Design of Geometric Algorithms |
FUN
2007
Springer
13 years 12 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
CAEPIA
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. In this paper, some new approaches to training set size reduction are presented. These schemes basically consist of defining a small number of prototypes that represent ...
TIT
2002
13 years 5 months ago
2002
Abstract--The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms fo...