25 search results - page 2 / 5 » GRASP with Path-Relinking for the Weighted Maximum Satisfiab... |
DAM
2006
13 years 11 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
COLING
2010
13 years 5 months ago
2010
This paper presents a novel method for acquiring a set of query patterns to retrieve documents containing important information about an entity. Given an existing Wikipedia catego...
RTSS
2003
IEEE
14 years 4 months ago
2003
IEEE
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
APPROX
2010
Springer
14 years 12 days ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
CP
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...