Sciweavers

5169 search results - page 1021 / 1034
» Locality approximation using time
Sort
View
PODC
2004
ACM
14 years 1 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
AMAST
2004
Springer
14 years 1 months ago
A Science of Software Design
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...
Don S. Batory
KR
2004
Springer
14 years 1 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
14 years 1 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
COMPGEOM
2003
ACM
14 years 1 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
« Prev « First page 1021 / 1034 Last » Next »