7758 search results - page 394 / 1552 » On the Number of Distributive Lattices |
190
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
180
click to vote
HPCC
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
218
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract--The current trend in high performance computing is to aggregate ever larger numbers of processing and interconnection elements in order to achieve desired levels of compu...
154
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
In this paper, we derive optimal bidding strategies for a global bidder who participates in multiple, simultaneous second-price auctions with perfect substitutes. We first conside...
138
click to vote
JGT
2008
15 years 6 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...