Sciweavers

4843 search results - page 586 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
P2P
2006
IEEE
135views Communications» more  P2P 2006»
15 years 10 months ago
Ordered Slicing of Very Large-Scale Overlay Networks
Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applicatio...
Márk Jelasity, Anne-Marie Kermarrec
SEFM
2006
IEEE
15 years 10 months ago
A Theory of Singly-Linked Lists and its Extensible Decision Procedure
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
Silvio Ranise, Calogero G. Zarba
SI3D
2006
ACM
15 years 10 months ago
Variance shadow maps
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
William Donnelly, Andrew Lauritzen
IDEAL
2005
Springer
15 years 10 months ago
Bearing Similarity Measures for Self-organizing Feature Maps
The neural representation of space in rats has inspired many navigation systems for robots. In particular, Self-Organizing (Feature) Maps (SOM) are often used to give a sense of lo...
Narongdech Keeratipranon, Frédéric M...
SAT
2005
Springer
145views Hardware» more  SAT 2005»
15 years 10 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman