Sciweavers

1487 search results - page 237 / 298
» The Computational Complexity of Link Building
Sort
View
ICPADS
2005
IEEE
15 years 7 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
ISCA
2005
IEEE
81views Hardware» more  ISCA 2005»
15 years 7 months ago
The Impact of Performance Asymmetry in Emerging Multicore Architectures
Performance asymmetry in multicore architectures arises when individual cores have different performance. Building such multicore processors is desirable because many simple cores...
Saisanthosh Balakrishnan, Ravi Rajwar, Michael Upt...
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
15 years 7 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 7 months ago
Quality-time analysis of multi-objective evolutionary algorithms
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg
108
Voted
VAST
2004
ACM
15 years 7 months ago
A case study of a virtual audience in a reconstruction of an ancient Roman odeon in Aphrodisias
The benefits of including virtual humans into cultural heritage reconstructions are twofold: the realism of architectural models is increased by populating them; and, as well, it...
Pablo de Heras Ciechomski, Branislav Ulicny, Rache...