6105 search results - page 225 / 1221 » A Parallel Algorithm for Bound-Smoothing |
189
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
172
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
131
click to vote
PDPTA
2007
15 years 7 months ago
2007
AgentTeamwork coordinates parallel job execution in a hierarchy of mobile agents. A collection of specialized agents are deployed to remote sites including multiple clusters so as...
141
click to vote
UAI
1997
15 years 7 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
178
Voted
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper is focused on the problem of aggregation of probability distribution applicable for parallel Bivariate Marginal Distribution Algorithm (pBMDA). A new approach based on...