Sciweavers

5793 search results - page 848 / 1159
» Individual communication complexity
Sort
View
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
15 years 10 months ago
Efficient memoryless protocol for tag identification
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Ching Law, Kayi Lee, Kai-Yeung Siu
ICPADS
1998
IEEE
15 years 10 months ago
Fault Tolerant All-to-All Broadcast in General Interconnection Networks
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin, Keqin ...
PPSN
1998
Springer
15 years 10 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...
SC
1995
ACM
15 years 10 months ago
Index Array Flattening Through Program Transformation
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
Raja Das, Paul Havlak, Joel H. Saltz, Ken Kennedy
SEKE
1995
Springer
15 years 10 months ago
Visual Scenarios for Validation of Requirements Specification
The development of a large information system is generally regarded as one of the most complex activities undertaken by organizations and it is dependent on the communication and u...
V. Lalioti, Babis Theodoulidis