16404 search results - page 376 / 3281 » A set coverage problem |
180
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
131
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
185
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
141
click to vote
ORL
2008
15 years 6 months ago
2008
Consider the problem of maximizing the toll revenue collected on a multi-commodity transportation network. This fits a bilevel framework where a leader sets tolls, while users res...
241
Voted
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...