Sciweavers

2244 search results - page 137 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
RECSYS
2009
ACM
16 years 26 days ago
Regret-based optimal recommendation sets in conversational recommender systems
Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an ap...
Paolo Viappiani, Craig Boutilier
ADC
2005
Springer
114views Database» more  ADC 2005»
15 years 12 months ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
FOCS
2006
IEEE
16 years 13 days ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 3 months ago
Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin