1871 search results - page 49 / 375 » The Ephemeral Pairing Problem |
182
click to vote
ASPDAC
2006
ACM
16 years 8 days ago
2006
ACM
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
154
click to vote
CIA
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Evaluations of distances or similarity measurements are very important in cooperative problem solving with multiple agents. Distance between problems is used by agents to...
156
click to vote
ESA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
165
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
161
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...