Sciweavers

2497 search results - page 5 / 500
» Requirements for models of achievable routing
Sort
View
GECCO
2007
Springer
129views Optimization» more  GECCO 2007»
16 years 6 days ago
Achieving a simple development model for 3D shapes: are chemicals necessary?
Artificial Development Systems have been introduced as a technique aimed at increasing the scalability of evolutionary algorithms. Most commonly the development model is part of ...
Pauline C. Haddow, Johan Hoye
COLCOM
2005
IEEE
15 years 11 months ago
A formal communication model for lookup operations in a hypercube-based P2P data store
P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additio...
Dietrich Fahrenholtz, Andreas Wombacher
INFSOF
2006
97views more  INFSOF 2006»
15 years 6 months ago
Applying Model-Driven Architecture to achieve distribution transparencies
This paper proposes a principled methodology for the realization of distribution transparencies. The proposed methodology is placed within the general context of Model-Driven Arch...
Apostolos Zarras
I3E
2010
129views Business» more  I3E 2010»
15 years 4 months ago
Achieving Meaning Understanding in E-Marketplace through Document Sense Disambiguation
E-marketplace has a very important requirement of achieving mutual meaning understanding between sellers and buyers. To meet this requirement, this paper has proposed a novel SD-DS...
Jingzhi Guo, Guangyi Xiao
DAC
2006
ACM
16 years 20 hour ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone