7758 search results - page 1294 / 1552 » On the Number of Distributive Lattices |
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
194
click to vote
DC
2010
15 years 6 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
176
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Low-level processing and normalization of microarray data are most important steps in microarray analysis, which have profound impact on downstream analysis. Multiple ...
189
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
160
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...