597 search results - page 71 / 120 » Homomorphisms of random paths |
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
CANS
2005
Springer
14 years 3 months ago
2005
Springer
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...
WSC
2004
13 years 11 months ago
2004
We consider single-stage, single-product Make-to-Stock systems with random demand and random service (production) rate, where demand shortages at the inventory facility are backor...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
SODA
2007
ACM
13 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...