Sciweavers

13214 search results - page 326 / 2643
» Pseudorandomness for network algorithms
Sort
View
DSN
2008
IEEE
16 years 1 months ago
Scheduling algorithms for unpredictably heterogeneous CMP architectures
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing performance and power characteristics to differ amo...
Jonathan A. Winter, David H. Albonesi
IJCNN
2000
IEEE
15 years 11 months ago
A Constraint Learning Algorithm for Blind Source Separation
In Jutten’s blind separation algorithm, symmetrical distribution and statistical independence of the signal sources are assumed. When they are not satisfied, the learning proce...
Kenji Nakayama, Akihiro Hirano, Motoki Nitta
COMPCON
1996
IEEE
15 years 11 months ago
Broadband Algorithms with the MicroUnity MediaProcessor
An important objective of the MicroUnity mediaprocessor is to allow the design of systems that replace hardwired functionality with software. One of the key design techniques that...
Curtis Abbott, Henry Massalin, Kevin Peterson, Tom...
SIGCOMM
1996
ACM
15 years 11 months ago
Adaptive Resource Management Algorithms for Indoor Mobile Computing Environments
Emerging indoor mobile computing environments seek to provide a user with an advanced setofcommunication-intensive applications, which require sustained quality of service in the ...
Songwu Lu, Vaduvur Bharghavan
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
15 years 8 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...