Sciweavers

4451 search results - page 136 / 891
» On Random Ordering Constraints
Sort
View
BIOCOMP
2006
15 years 6 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 8 days ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
POPL
1992
ACM
15 years 8 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
137
Voted
HPCA
2004
IEEE
16 years 5 months ago
Out-of-Order Commit Processors
Modern out-of-order processors tolerate long latency memory operations by supporting a large number of inflight instructions. This is particularly useful in numerical applications...
Adrián Cristal, Daniel Ortega, Josep Llosa,...
ATAL
2004
Springer
15 years 10 months ago
Desires, Norms and Constraints
This paper deals with modeling mental states of a rational agent, in particular states based on agent’s desires. It shows that the world the agent belongs to forces it to restri...
Laurence Cholvy, Christophe Garion