Sciweavers

881 search results - page 53 / 177
» Solving satisfiability problems with preferences
Sort
View
IJON
2010
112views more  IJON 2010»
13 years 6 months ago
Efficient voting prediction for pairwise multilabel classification
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to qu...
Eneldo Loza Mencía, Sang-Hyeun Park, Johann...
TSMC
2010
13 years 3 months ago
Multiobjective Optimization of Temporal Processes
Abstract--This paper presents a dynamic predictiveoptimization framework of a nonlinear temporal process. Datamining (DM) and evolutionary strategy algorithms are integrated in the...
Zhe Song, Andrew Kusiak
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 18 days ago
Interactive query refinement
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...
Chaitanya Mishra, Nick Koudas
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 8 months ago
A Quantifier Elimination Algorithm for Linear Real Arithmetic
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
David Monniaux
AMT
2009
Springer
116views Multimedia» more  AMT 2009»
14 years 3 months ago
Unifying Web-Scale Search and Reasoning from the Viewpoint of Granularity
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
Yi Zeng, Yan Wang, Zhisheng Huang, Ning Zhong