Sciweavers

7421 search results - page 125 / 1485
» In search of dependable design
Sort
View
CPC
2008
135views more  CPC 2008»
15 years 6 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
ICGA
2007
80views Optimization» more  ICGA 2007»
15 years 6 months ago
Factors Affecting Diminishing Returns for Searching Deeper
The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behavio...
Matej Guid, Ivan Bratko
ICIP
2008
IEEE
16 years 8 months ago
Long term learning for image retrieval over networks
In this paper, we present a long term learning system for content based image retrieval over a network. Relevant feedback is used among different sessions to learn both the simila...
David Picard, Arnaud Revel, Matthieu Cord
KI
2007
Springer
16 years 17 days ago
Inductive Synthesis of Recursive Functional Programs
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
Martin Hofmann 0008, Andreas Hirschberger, Emanuel...
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 7 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens