Sciweavers

12194 search results - page 2229 / 2439
» Numberings Optimal for Learning
Sort
View
PE
2002
Springer
128views Optimization» more  PE 2002»
15 years 6 months ago
Response times in a two-node queueing network with feedback
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
Robert D. van der Mei, Bart Gijsen, N. in't Veld, ...
SIAMJO
2002
92views more  SIAMJO 2002»
15 years 6 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
TPDS
1998
92views more  TPDS 1998»
15 years 6 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
ISPDC
2010
IEEE
15 years 5 months ago
Resource-Aware Compiler Prefetching for Many-Cores
—Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi- ...
George C. Caragea, Alexandros Tzannes, Fuat Keceli...
PE
2010
Springer
102views Optimization» more  PE 2010»
15 years 5 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
« Prev « First page 2229 / 2439 Last » Next »