Sciweavers

265 search results - page 30 / 53
» Neighborhood Composition: A Parallelization of Local Search ...
Sort
View
TCAD
2002
93views more  TCAD 2002»
13 years 7 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
13 years 11 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
AIPS
2006
13 years 8 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
SSIAI
2002
IEEE
14 years 9 days ago
Geometry-Based Automatic Object Localization and 3-D Pose Detection
Given the image of a real-world scene and a polygonal 3-D model of a depicted object, its apparent size, image coordinates, and 3-D orientation are autonomously detected. Based on...
Marcus A. Magnor
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru