Sciweavers

986 search results - page 128 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Multiclass multiple kernel learning
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
Alexander Zien, Cheng Soon Ong
ECOOP
2001
Springer
14 years 1 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
CP
2000
Springer
14 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
FOCS
1998
IEEE
14 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
JMLR
2008
150views more  JMLR 2008»
13 years 9 months ago
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
Vojtech Franc, Bogdan Savchynskyy