Sciweavers

435 search results - page 45 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
IJAIT
2000
142views more  IJAIT 2000»
14 years 9 months ago
Adequacy of Limited Testing for Knowledge Based Systems
Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration mi...
Tim Menzies, Bojan Cukic
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 3 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
ICDAR
1999
IEEE
15 years 2 months ago
A Two-state Markov Chain Model of Degraded Document Images
We propose a two-state Markov chain model of degraded document images. The model generates random and burst noise to simulate isolated pixel reversal as well as blurring of a larg...
Shamik Sural, P. K. Das
INFOCOM
2008
IEEE
15 years 4 months ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco