1725 search results - page 42 / 345 » Relaxed genetic programming |
CP
2009
Springer
14 years 6 months ago
2009
Springer
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
ICASSP
2008
IEEE
14 years 5 months ago
2008
IEEE
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
CCGRID
2006
IEEE
14 years 5 months ago
2006
IEEE
Since participants in a computational Grid may be independent bodies, some mechanisms are necessary for resolving their differences. The contribution of this work is designing a b...
HOTOS
2007
IEEE
14 years 3 months ago
2007
IEEE
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
JCO
1998
13 years 10 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...