Sciweavers

316 search results - page 42 / 64
» Cognitive Foundations of Probability
Sort
View
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICASSP
2011
IEEE
13 years 10 days ago
BEP walls for collaborative spectrum sensing
—The main focus of this paper is to present a performance limitation of collaborative spectrum sensing in cognitive radios with imperfect reporting channels. We consider hard dec...
Sachin Chaudhari, Jarmo Lundén, Visa Koivun...
IPSN
2004
Springer
14 years 2 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
JELIA
2004
Springer
14 years 2 months ago
Practical Reasoning for Uncertain Agents
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
Nivea de Carvalho Ferreira, Michael Fisher, Wiebe ...