Sciweavers

2969 search results - page 390 / 594
» A space efficient algorithm for group structure computation
Sort
View
AINA
2006
IEEE
15 years 11 months ago
Peer-Tree: A Hybrid Peer-to-Peer Overlay for Service Discovery
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
Jing Tie, Hai Jin, Shengli Li, Xuanhua Shi, Hanhua...
JEA
2006
90views more  JEA 2006»
15 years 5 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
147
Voted
EUC
2004
Springer
15 years 10 months ago
Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi, Mi...
AIPS
2009
15 years 6 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 5 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu