Sciweavers

594 search results - page 105 / 119
» Atomicity in Electronic Commerce
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 23 days ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
IANDC
2006
121views more  IANDC 2006»
13 years 8 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
JCC
2008
131views more  JCC 2008»
13 years 8 months ago
An optimized initialization algorithm to ensure accuracy in quantum Monte Carlo calculations
: Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...
Daniel R. Fisher, David R. Kent IV, Michael T. Fel...
ICDE
2004
IEEE
108views Database» more  ICDE 2004»
14 years 10 months ago
Priority Mechanisms for OLTP and Transactional Web Applications
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
David T. McWherter, Bianca Schroeder, Anastassia A...
SIGSOFT
2004
ACM
14 years 9 months ago
Testing static analysis tools using exploitable buffer overflows from open source code
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
Misha Zitser, Richard Lippmann, Tim Leek