Sciweavers

313 search results - page 15 / 63
» Complete Local Search with Memory
Sort
View
NN
2011
Springer
348views Neural Networks» more  NN 2011»
13 years 4 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
ISER
1997
Springer
115views Robotics» more  ISER 1997»
14 years 2 months ago
Mechanical Design and Control of a High-Bandwidth Shape Memory Alloy Tactile Display
: We have constructed a tactile shape display which can be used to convey small-scale shapes in teleoperation and virtual environments. A line of 10 pins spaced 2 mm on center are ...
Parris S. Wellman, William J. Peine, Gregg Favalor...
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 10 months ago
Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling
One of the differences among the various approaches to suspension-based tabled evaluation is the scheduling strategy. The two most popular strategies are local and batched evaluat...
Pablo Chico de Guzmán, Manuel Carro, David ...
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 10 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
CP
2003
Springer
14 years 3 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings