Sciweavers

2370 search results - page 58 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
OPODIS
2004
14 years 11 months ago
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
Hirotsugu Kakugawa, Masafumi Yamashita
ECAI
2010
Springer
14 years 11 months ago
ISAC - Instance-Specific Algorithm Configuration
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, ...
IPPS
2007
IEEE
15 years 4 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
ISAAC
2007
Springer
77views Algorithms» more  ISAAC 2007»
15 years 3 months ago
On the Relative Dominance of Paging Algorithms
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
Reza Dorrigiv, Alejandro López-Ortiz, J. Ia...
ISNN
2007
Springer
15 years 3 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek