Sciweavers

72 search results - page 14 / 15
» Fast Planning by Search in Domain Transition Graph
Sort
View
AIPS
2008
14 years 12 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
WSC
2007
14 years 12 months ago
Enabling smooth and scalable dynamic 3d visualization of discrete-event construction simulations in outdoor augmented reality
Visualization is a powerful method for verifying, validating, and communicating the results of a simulated model. Lack of visual understanding about a simulated model is one of th...
Amir H. Behzadan, Vineet R. Kamat
86
Voted
ICS
2007
Tsinghua U.
15 years 3 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
97
Voted
IAT
2010
IEEE
14 years 7 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
248
Voted

Publication
1500views
16 years 10 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected aut...
M. Sabry Hassouna, Aly A. Farag