Sciweavers

2555 search results - page 148 / 511
» Quantifiers and Working Memory
Sort
View
147
Voted
KR
2004
Springer
15 years 9 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
108
Voted
IJCNN
2000
IEEE
15 years 8 months ago
Non-Destructive Test by the Hopfield Network
The aim of this work is to propose and discuss a technique which allows for classifying the defects found in metallic components on the basis of a non-destructive Remote-Field Edd...
S. Barcherini, L. Cipiccia, M. Maggi, Simone Fiori...
125
Voted
IC
2004
15 years 5 months ago
Optimizing Performance of Web Services with Chunk-Overlaying and Pipelined-Send
The performance of a Web service is primarily dependent on the design and implementation of its SOAP toolkit. SOAP is widely implemented using HTTP as the transport protocol and X...
Nayef Abu-Ghazaleh, Madhusudhan Govindaraju, Micha...
APDC
1994
15 years 5 months ago
WEA, a Distributed Object Manager Based on a Workspace Hierarchy
WEA is our implementation of a new architectural model for virtual memory access, the WorkSpace. It relies on a generalisation of client / server model and enables to build new di...
Didier Donsez, Philippe Homond, Pascal Faudemay
112
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
Communication-avoiding parallel and sequential QR factorizations
We present parallel and sequential dense QR factorization algorithms that are optimized to avoid communication. Some of these are novel, and some extend earlier work. Communicatio...
James Demmel, Laura Grigori, Mark Hoemmen, Julien ...