1369 search results - page 112 / 274 » Lattice computations for random numbers |
FOCI
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
GRID
2004
Springer
14 years 2 months ago
2004
Springer
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
EUROPAR
1997
Springer
14 years 1 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...