Sciweavers

7522 search results - page 1308 / 1505
» Spacing memetic algorithms
Sort
View
IJCAI
1997
13 years 11 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
SPIESR
1997
97views Database» more  SPIESR 1997»
13 years 11 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
WSC
1997
13 years 11 months ago
Computational Experience with the Batch Means Method
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
Christos Alexopoulos, George S. Fishman, Andrew F....
AIPS
1996
13 years 11 months ago
Least-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
Marc Friedman, Daniel S. Weld
SOSP
1993
ACM
13 years 11 months ago
Protection Traps and Alternatives for Memory Management of an Object-Oriented Language
Many operating systems allow user programs to specify the protectionlevel (inaccessible, read-only, read-write) of pages in their virtual memory address space, and to handle any p...
Antony L. Hosking, J. Eliot B. Moss
« Prev « First page 1308 / 1505 Last » Next »