3394 search results - page 674 / 679 » A Modal Model of Memory |
102
click to vote
ALGORITHMICA
2000
14 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
JACM
2000
14 years 9 months ago
2000
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
107
click to vote
CC
1998
Springer
14 years 9 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
CGA
1999
14 years 9 months ago
1999
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
NN
2007
Springer
14 years 9 months ago
2007
Springer
Echo State Networks (ESNs) have been shown to be effective for a number of tasks, including motor control, dynamic time series prediction, and memorizing musical sequences. Howeve...