Sciweavers

28497 search results - page 5684 / 5700
» Improving experiences of computation
Sort
View
FM
2009
Springer
134views Formal Methods» more  FM 2009»
13 years 5 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
GVD
2009
108views Database» more  GVD 2009»
13 years 5 months ago
Privacy Challenges for Database Systems
Over the last years the means to collect personal data implicitly or explicitly over the Web and by various kinds of sensors and to combine data for profiling individuals has dram...
Johann Christoph Freytag
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
13 years 5 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
13 years 5 months ago
The Flexible Climate Data Analysis Tools (CDAT) for Multi-model Climate Simulation Data
Being able to incorporate, inspect, and analyze data with newly developed technologies, diagnostics, and visualizations in an easy and flexible way has been a longstanding challen...
Dean N. Williams, Charles M. Doutriaux, Robert S. ...
ICTAI
2009
IEEE
13 years 5 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
« Prev « First page 5684 / 5700 Last » Next »