Sciweavers

1941 search results - page 130 / 389
» On the Hardness of Approximate Reasoning
Sort
View
LPAR
2005
Springer
15 years 12 months ago
Integration of a Software Model Checker into Isabelle
Abstract. The paper presents a combination of interactive and automatic tools in the area of software verification. We have integrated a newly developed software model checker int...
Matthias Daum, Stefan Maus, Norbert Schirmer, M. N...
ISCC
2003
IEEE
115views Communications» more  ISCC 2003»
15 years 11 months ago
Pricing Granularity for Congestion-Sensitive Pricing
One of the key issues for implementing congestion pricing is the pricing granularity (i.e. pricing interval or timescale). The Internet traffic is highly variant and hard to cont...
Murat Yuksel, Shivkumar Kalyanaraman
IJIS
2010
110views more  IJIS 2010»
15 years 3 months ago
The ramification problem in temporal databases: Concurrent execution
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Dimitris Plexousakis, Grigoris An...
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 28 days ago
A Model for Coherent Distributed Memory For Race Condition Detection
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
Franck Butelle, Camille Coti
AAAI
2011
14 years 6 months ago
Controlling Selection Bias in Causal Inference
Selection bias, caused by preferential exclusion of samples from the data, is a major obstacle to valid causal and statistical inferences; it cannot be removed by randomized exper...
Elias Bareinboim, Judea Pearl