Sciweavers

1139 search results - page 40 / 228
» Bounded Ideation Theory
Sort
View
IPTPS
2005
Springer
14 years 2 months ago
A Statistical Theory of Chord Under Churn
Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we pr...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
KI
2001
Springer
14 years 1 months ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
Stefan Edelkamp, Ulrich Meyer
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 9 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 8 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar