Sciweavers

62 search results - page 11 / 13
» ipl 2010
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 4 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
IPL
2010
93views more  IPL 2010»
13 years 4 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin
IPL
2010
112views more  IPL 2010»
13 years 4 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
IPL
2010
94views more  IPL 2010»
13 years 4 months ago
Partial model checking via abstract interpretation
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
Nicoletta De Francesco, Giuseppe Lettieri, Luca Ma...
IPL
2010
141views more  IPL 2010»
13 years 1 months ago
On the differential and linear efficiency of balanced Feistel networks
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
Andrey Bogdanov