Sciweavers

8298 search results - page 268 / 1660
» On the Complexity of Numerical Analysis
Sort
View
JSSPP
2005
Springer
16 years 23 days ago
Pitfalls in Parallel Job Scheduling Evaluation
There are many choices to make when evaluating the performance of a complex system. In the context of parallel job scheduling, one must decide what workload to use and what measur...
Eitan Frachtenberg, Dror G. Feitelson
ACRI
2004
Springer
16 years 20 days ago
Chaos in a Simple Cellular Automaton Model of a Uniform Society
In this work we study the collective behavior in a model of a simplified homogeneous society. Each agent is modeled as a binary “perceptron”, receiving neighbors’ opinions a...
Franco Bagnoli, Fabio Franci, Raúl Rechtman
AIPS
2009
15 years 8 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
ICASSP
2009
IEEE
15 years 5 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz
ICASSP
2011
IEEE
14 years 11 months ago
A variable step size evolutionary affine projection algorithm
It is well known that the affine projection algorithm (APA) offers a good tradeoff between convergence rate/tracking and computational complexity. Recently, the evolutionary APA (...
Felix Albu, Constantin Paleologu, Jacob Benesty