Sciweavers

5326 search results - page 280 / 1066
» On what we can ensure
Sort
View
FCS
2007
15 years 8 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
TON
2010
197views more  TON 2010»
15 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
TKDE
2011
528views more  TKDE 2011»
15 years 1 months ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen
CVPR
1999
IEEE
16 years 8 months ago
On the Intrinsic Reconstruction of Shape from its Symmetries
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
Peter J. Giblin, Benjamin B. Kimia
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 8 months ago
Merging Hierarchies Using Object Placement
The main challenge in integrating two hierarchies is determining the correspondence between the nodes and edges of each hierarchy. Traditionally, the correspondence is determined ...
Kai Zhao, Robert Ikeda, Hector Garcia-Molina