Sciweavers

5792 search results - page 1140 / 1159
» Communicating With Multiple Agents
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ISPW
1991
IEEE
13 years 11 months ago
Policy-directed coordination and cooperation
product and the project as well as to define synchronization (or interaction) abstractions; activity definitions are used to model the process activities that transform the produ...
Dewayne E. Perry
WSC
2007
13 years 9 months ago
A model for contact center analysis and simulation
In this paper we depart from a set of simple assumptions regarding the behavior of a pool of customers associated with an enterprise’s contact center. We assume that the pool of...
Juan M. Huerta
CANS
2008
Springer
118views Cryptology» more  CANS 2008»
13 years 9 months ago
Workload Characterization of a Lightweight SSL Implementation Resistant to Side-Channel Attacks
Abstract. Ever-growing mobility and ubiquitous wireless Internet access raise the need for secure communication with devices that may be severely constrained in terms of processing...
Manuel Koschuch, Johann Großschädl, Udo...
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
« Prev « First page 1140 / 1159 Last » Next »