Sciweavers

18090 search results - page 374 / 3618
» Computing by Only Observing
Sort
View
HOTI
2005
IEEE
16 years 9 days ago
Challenges in Building a Flat-Bandwidth Memory Hierarchy for a Large-Scale Computer with Proximity Communication
Memory systems for conventional large-scale computers provide only limited bytes/s of data bandwidth when compared to their flop/s of instruction execution rate. The resulting bo...
Robert J. Drost, Craig Forrest, Bruce Guenin, Ron ...
ICLP
2004
Springer
16 years 2 days ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
304
Voted
NEUROSCIENCE
2001
Springer
15 years 11 months ago
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
Mikel L. Forcada, Rafael C. Carrasco
FOCS
1998
IEEE
15 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
15 years 10 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...