14158 search results - page 275 / 2832 » Generalized switch-setting problems |
141
click to vote
AAAI
2008
15 years 6 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
131
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
126
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
145
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
118
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...