Sciweavers

392 search results - page 22 / 79
» Maximal Completion
Sort
View
SPDP
1991
IEEE
14 years 1 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
WCE
2007
13 years 11 months ago
Models of Adding Relations to a Linking Pin Type Organization Structure
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Kiyoshi Sawada
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 10 months ago
A dynamical model of a GRID market
We discuss potential market mechanisms for the GRID. A complete dynamical model of a GRID market is defined with three types of agents. Providers, middlemen and users exchange uni...
Uli Harder, Peter G. Harrison, Maya Paczuski, Teja...
IAT
2007
IEEE
14 years 4 months ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 11 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