3422 search results - page 410 / 685 » Random Subset Optimization |
124
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
175
click to vote
INFOCOM
1991
IEEE
15 years 7 months ago
1991
IEEE
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
153
click to vote
IACR
2011
14 years 3 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
137
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
135
click to vote
IPMI
2003
Springer
15 years 9 months ago
2003
Springer
We use the performance of the Bayesian ideal observer as a figure of merit for hardware optimization because this observer makes optimal use of signal-detection information. Due t...