Sciweavers

2035 search results - page 108 / 407
» Working memory
Sort
View
KR
2004
Springer
15 years 8 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
EUROCAST
2003
Springer
130views Hardware» more  EUROCAST 2003»
15 years 8 months ago
A Model of Neural Inspiration for Local Accumulative Computation
This paper explores the computational capacity of a novel local computational model that expands the conventional analogical and logical dynamic neural models, based on the charge ...
José Mira, Miguel Angel Fernández, M...
APDC
1994
15 years 4 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
137
Voted
WISE
2005
Springer
15 years 8 months ago
Semantic Web Technologies for Interpreting DNA Microarray Analyses: The MEAT System
Abstract. This paper describes MEAT (Memory of Experiments for the Analysis of Transcriptomes), a project aiming at supporting biologists working on DNA microarrays. We provide met...
Khaled Khelif, Rose Dieng-Kuntz, Pascal Barbry
122
Voted
SIGSOFT
2005
ACM
16 years 4 months ago
CUTE: a concolic unit testing engine for C
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
Koushik Sen, Darko Marinov, Gul Agha