Sciweavers

1576 search results - page 124 / 316
» Properties of Synthetic Optimization Problems
Sort
View
IJRR
2008
115views more  IJRR 2008»
15 years 4 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
GECCO
2009
Springer
15 years 11 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
PDPTA
2000
15 years 5 months ago
Parallel Real-Time Cryptography: Beyond Speedup II
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second eq...
Selim G. Akl, Stefan D. Bruda
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
14 years 7 months ago
Apples and oranges: a comparison of RDF benchmarks and real RDF datasets
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research...
Songyun Duan, Anastasios Kementsietsidis, Kavitha ...
MICCAI
2007
Springer
16 years 5 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...