Sciweavers

1058 search results - page 30 / 212
» It's Doomed; We Can Prove It
Sort
View
IJACT
2010
67views more  IJACT 2010»
13 years 4 months ago
On message recognition protocols: recoverability and explicit confirmation
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
IPPS
2010
IEEE
13 years 7 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
14 years 3 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
IRI
2009
IEEE
14 years 4 months ago
Collaborative Schema Construction using Regular Sequence Types
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
Jorge Coelho, Mário Florido, Temur Kutsia
FLAIRS
2007
14 years 6 days ago
The Operational Annotation and the Analysis of the Correlative Coordination in French
Despite extensive theoretical work carried out on coordination during the last three decades, much research is still devoted to proving the merits of one model over another. In ou...
Ismaïl Biskri, Marc André Rochette