We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
Pharmaceutic studies require to analyze thousands of ECGs in order to evaluate the side effects of a new drug. In this paper we present a new approach to automatic ECG segmentatio...
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
Enterprise corpora contain evidence of what employees work on and therefore can be used to automatically find experts on a given topic. We present a general approach for represen...
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
This paper reports our investigation on the problem of belief update in Bayesian networks (BN) using uncertain evidence. We focus on two types of uncertain evidences, virtual evid...