3894 search results - page 373 / 779 » Approximation Algorithms for Biclustering Problems |
158
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
134
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
138
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
140
click to vote
CCCG
2007
15 years 6 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
143
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...