14161 search results - page 270 / 2833 » On generalized middle-level problem |
153
click to vote
IWOCA
2009
Springer
16 years 1 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...
183
click to vote
TAMC
2009
Springer
16 years 1 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...
154
click to vote
GECCO
2007
Springer
16 years 22 days 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...
171
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
145
click to vote
COCOON
2005
Springer
16 years 3 days ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...