Sciweavers

1469 search results - page 220 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 6 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KES
2005
Springer
15 years 11 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
SEAA
2008
IEEE
16 years 16 days ago
VieCAR - Enabling Self-adaptive Collaboration Services
Novel forms of collaboration increasingly distribute control among e-workers, thereby allowing agile and autonomous collaboration. However, this requires a novel blend of infrastr...
Daniel Schall, Christoph Dorn, Schahram Dustdar, I...
GCB
1997
Springer
77views Biometrics» more  GCB 1997»
15 years 10 months ago
Statistics of large scale sequence searching
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
Rainer Spang, Martin Vingron
NIPS
2008
15 years 7 months ago
Adapting to a Market Shock: Optimal Sequential Market-Making
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
Sanmay Das, Malik Magdon-Ismail