3820 search results - page 486 / 764 » Bounded Model Debugging |
103
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
141
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
115
click to vote
SP
2009
IEEE
15 years 10 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
129
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
135
Voted
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...