Sciweavers

15494 search results - page 356 / 3099
» Computing dynamic clusters
Sort
View
CSE
2009
IEEE
16 years 1 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
EAGC
2004
Springer
16 years 4 days ago
Connecting Condor Pools into Computational Grids by Jini
This paper describes how Condor-pools could be joined together to form a large computational cluster-grid. In the architecture Jini provides the infrastructure for resource lookup,...
Gergely Sipos, Péter Kacsuk
GECCO
2007
Springer
199views Optimization» more  GECCO 2007»
16 years 28 days ago
Multi-objective particle swarm optimization on computer grids
Abstract. In recent years, a number of authors have successfully extended particle swarm optimization to problem domains with multiple objectives. This paper addresses the issue of...
Sanaz Mostaghim, Jürgen Branke, Hartmut Schme...
APCSAC
2006
IEEE
16 years 25 days ago
Reliable Systolic Computing Through Redundancy
The systolic array paradigm has low communication demand because it does not use costly global communication and each processor communicates with few other processors. It is thus s...
Kunio Okuda, Siang Wun Song, Marcos Tatsuo Yamamot...
EWSN
2004
Springer
16 years 6 months ago
Design of Surveillance Sensor Grids with a Lifetime Constraint
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
Vivek Mhatre, Catherine Rosenberg, Daniel Kofman, ...