Sciweavers

1041 search results - page 174 / 209
» Randomizing Reductions of Search Problems
Sort
View
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
ECAI
2006
Springer
13 years 11 months ago
Knowledge Engineering for Bayesian Networks: How Common Are Noisy-MAX Distributions in Practice?
One problem faced in knowledge engineering for Bayesian networks is the exponential growth of the number of parameters in their conditional probability tables (CPTs). The most comm...
Adam Zagorecki, Marek J. Druzdzel
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
13 years 11 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...
UAI
2003
13 years 9 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel
IS
2008
13 years 7 months ago
Continuous subspace clustering in streaming time series
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...