1310 search results - page 152 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
100
click to vote
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
101
click to vote
FCCM
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...