8125 search results - page 385 / 1625 » Parallelism and evolutionary algorithms |
137
Voted
CRYPTO
2010
Springer
15 years 6 months ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
136
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
109
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
247
click to vote
EC
2011
14 years 11 months ago
2011
Whereas the current practice of designing antennas by hand is severely limited because it is both time and labor intensive and requires a significant amount of domain knowledge, ...
152
click to vote
ICAISC
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...