13376 search results - page 550 / 2676 » Problem Solving with |
185
Voted
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
191
click to vote
CCS
2007
ACM
16 years 1 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
215
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
238
click to vote
KR
1992
Springer
15 years 11 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
172
click to vote
ISPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...