92 search results - page 14 / 19 » Evolving heuristically difficult instances of combinatorial ... |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Maintaining a legacy database is a difficult task especially when system documentation is poor written or even missing. Database reverse engineering is an attempt to recover high-...
TC
2010
14 years 4 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
DAGSTUHL
2007
14 years 11 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
107
Voted
SIAMJO
2002
14 years 9 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
100
click to vote
ICN
2001
Springer
15 years 1 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...