Sciweavers

762 search results - page 66 / 153
» Finding Facilities Fast
Sort
View
CSI
2006
136views more  CSI 2006»
14 years 9 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
CORR
2004
Springer
168views Education» more  CORR 2004»
14 years 9 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
TON
2008
120views more  TON 2008»
14 years 9 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 7 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
EACL
2009
ACL Anthology
14 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud