Sciweavers

1099 search results - page 141 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
PCI
2005
Springer
15 years 3 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
CONPAR
1992
15 years 2 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
MM
2005
ACM
103views Multimedia» more  MM 2005»
15 years 3 months ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada
DAC
1998
ACM
15 years 2 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
TCSB
2010
14 years 8 months ago
Modelling Self-assembly in BlenX
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
Roberto Larcher, Corrado Priami, Alessandro Romane...