Sciweavers

14382 search results - page 2685 / 2877
» Time in Connectionist Models
Sort
View
120
Voted
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 7 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
DSD
2009
IEEE
118views Hardware» more  DSD 2009»
15 years 6 months ago
On the Risk of Fault Coupling over the Chip Substrate
—Duplication and comparison has proven to be an efficient method for error detection. Based on this generic principle dual core processor architectures with output comparison ar...
Peter Tummeltshammer, Andreas Steininger
132
Voted
LISA
2008
15 years 5 months ago
Devolved Management of Distributed Infrastructures with Quattor
In recent times a new kind of computing system has emerged: a distributed infrastructure composed of multiple physical sites in different administrative domains. This model introd...
Stephen Childs, Marco Emilio Poleggi, Charles Loom...
122
Voted
USENIX
2007
15 years 5 months ago
MapJAX: Data Structure Abstractions for Asynchronous Web Applications
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
Daniel S. Myers, Jennifer N. Carlisle, James A. Co...
148
Voted
WSC
2007
15 years 5 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
« Prev « First page 2685 / 2877 Last » Next »