Sciweavers

940 search results - page 41 / 188
» Control Abstractions for Local Search
Sort
View
101
Voted
CAD
1998
Springer
15 years 2 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
76
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 2 months ago
Evaluating Call-By-Need on the Control Stack
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
Stephen Chang, David Van Horn, Matthias Felleisen
163
Voted
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
15 years 9 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
15 years 2 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 9 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...