Sciweavers

IJRR
2007
171views more  IJRR 2007»
13 years 11 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 11 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
13 years 11 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 11 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...
AI
2005
Springer
13 years 11 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
AI
2005
Springer
13 years 11 months ago
Asynchronous backtracking without adding links: a new member in the ABT family
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
Christian Bessière, Arnold Maestre, Ismel B...
SIGPRO
2008
151views more  SIGPRO 2008»
13 years 11 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng
SIGPRO
2008
74views more  SIGPRO 2008»
13 years 11 months ago
Speaker segmentation and clustering
This survey focuses on two challenging speech processing topics, namely: speaker segmentation and speaker clustering. Speaker segmentation aims at finding speaker change points in...
Margarita Kotti, Vassiliki Moschou, Constantine Ko...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 11 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 11 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl