16093 search results - page 30 / 3219 » On the optimality of the neighbor-joining algorithm |
125
click to vote
ICTAI
1997
IEEE
15 years 5 months ago
1997
IEEE
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
120
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
128
click to vote
WDAG
2004
Springer
15 years 6 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
115
click to vote
EACL
2009
ACL Anthology
14 years 11 months ago
2009
ACL Anthology
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...
122
click to vote
CSI
2006
15 years 1 months ago
2006
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...