153 search results - page 12 / 31 » Computing Approximate Solutions of the Maximum Covering Prob... |
84
Voted
MST
2010
14 years 10 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
93
Voted
JWSR
2007
14 years 11 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
100
click to vote
WWW
2005
ACM
16 years 10 days ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...