Sciweavers

697 search results - page 43 / 140
» On the Theory of Average Case Complexity
Sort
View
COMPGEOM
2003
ACM
15 years 5 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
APLAS
2007
ACM
15 years 3 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 1 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
EWCBR
2004
Springer
15 years 5 months ago
Software Design Retrieval Using Bayesian Networks and WordNet
The complexity of software systems makes design reuse a necessary task in the software development process. CASE tools can provide cognitive assistance in this task, helping the so...
Paulo Gomes
DAM
2008
111views more  DAM 2008»
14 years 12 months ago
Games played by Boole and Galois
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Aviezri S. Fraenkel