Sciweavers

554 search results - page 57 / 111
» Principles of scatter search
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
CHI
2002
ACM
14 years 8 months ago
SCANMail: a voicemail interface that makes speech browsable, readable and searchable
Increasing amounts of public, corporate, and private speech data are now available on-line. These are limited in their usefulness, however, by the lack of tools to permit their br...
Steve Whittaker, Julia Hirschberg, Brian Amento, L...
AMAST
2004
Springer
14 years 1 months ago
A Science of Software Design
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...
Don S. Batory
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 8 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
14 years 2 months ago
Minimum Wheel-Rotation Paths for Differential Drive Mobile Robots Among Piecewise Smooth Obstacles
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
Hamid Reza Chitsaz, Steven M. LaValle