Sciweavers

6693 search results - page 45 / 1339
» On an anytime algorithm for control
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 3 months ago
Simulative Analysis of a Multi-Cell Admission Control Algorithm in WCDMA Networks
— It has for long been recognized that in multi-cell wide-band code division multiple access (WCDMA) networks the admission of a new session into the system can have undesirable ...
Gábor Fodor, Gustavo Azzolin
ICC
2007
IEEE
216views Communications» more  ICC 2007»
14 years 3 months ago
Window-Based and Rate-Based Congestion Controls: a Local Stability Analysis under Variable RTT Conditions and the Proposal of an
— This paper mathematically frames the relation between window-based and rate-based congestion control algorithms, when the assumption of variable round-trip time conditions is i...
Michele Borri, Adriano Ferrarini, Maria Luisa Mera...
FCS
2006
13 years 10 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin
SAC
2010
ACM
14 years 4 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato