4377 search results - page 374 / 876 » Mass problems and randomness |
161
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
153
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
203
click to vote
ICMCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In the context of communication networks with no QoS guarantees, we describe the problem of streaming layer encoded multimedia presentation data as a two-phase decision problem. W...
166
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
169
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmit...