Sciweavers

3055 search results - page 73 / 611
» Randomized Search Trees
Sort
View
CPE
1997
Springer
79views Hardware» more  CPE 1997»
14 years 2 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
14 years 6 days ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
CP
2009
Springer
14 years 5 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
JCT
2007
150views more  JCT 2007»
13 years 10 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 3 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay