Sciweavers

392 search results - page 36 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
P2P
2009
IEEE
143views Communications» more  P2P 2009»
14 years 3 months ago
SimGrid: a Generic Framework for Large-Scale Distributed Experiments
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unf...
Martin Quinson
GECCO
2008
Springer
149views Optimization» more  GECCO 2008»
13 years 9 months ago
Real-time imitation-based adaptation of gaming behaviour in modern computer games
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
Steffen Priesterjahn, Alexander Weimer, Markus Ebe...
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 9 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer

Publication
173views
12 years 7 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...