Sciweavers

1405 search results - page 33 / 281
» Popularity at Minimum Cost
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
14 years 10 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
TMC
2010
178views more  TMC 2010»
14 years 8 months ago
Cost Analysis of Short Message Retransmissions
Short Message Service (SMS) is the most popular mobile data service today. In Taiwan, a subscriber sends more than 200 short messages per year on average. The huge demand for SMS ...
Sok-Ian Sou, Yi-Bing Lin, Chao-Liang Luo
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 1 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
HIS
2009
14 years 7 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
ASE
2010
126views more  ASE 2010»
14 years 9 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural