Sciweavers

4235 search results - page 87 / 847
» Process Spaces
Sort
View
AAAI
1996
15 years 4 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
FGCS
2000
93views more  FGCS 2000»
15 years 2 months ago
Sharing objects in a distributed, single address space environment
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
Gianluca Dini, Lanfranco Lopriore
ANNS
2010
14 years 10 months ago
Search Space Restriction of Neuro-evolution through Constrained Modularization of Neural Networks
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...
Christian W. Rempis, Frank Pasemann
IJCAI
1989
15 years 4 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 4 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu