Sciweavers

496 search results - page 45 / 100
» Machine models and lower bounds for query processing
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 2 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 1 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
SPAA
2009
ACM
14 years 4 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...
SIAMFM
2011
72views more  SIAMFM 2011»
12 years 10 months ago
Robust Hedging of Double Touch Barrier Options
We consider model-free pricing of digital options, which pay out if the underlying asset has crossed both upper and lower barriers. We make only weak assumptions about the underly...
A. M. G. Cox, Jan Obloj