Sciweavers

2370 search results - page 74 / 474
» A Structured Set of Higher-Order Problems
Sort
View

Publication
417views
14 years 5 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
14 years 2 months ago
Genetic programming: parametric analysis of structure altering mutation techniques
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
Alan Piszcz, Terence Soule
ANOR
2006
58views more  ANOR 2006»
13 years 9 months ago
A management system for decompositions in stochastic programming
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
Robert Fourer, Leo Lopes
RSEISP
2007
Springer
14 years 3 months ago
The Art of Granular Computing
The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose ...
Yiyu Yao
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee