Sciweavers

25 search results - page 2 / 5
» GRASP with Path-Relinking for the Weighted Maximum Satisfiab...
Sort
View
DAM
2006
136views more  DAM 2006»
13 years 6 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
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...
Taneli Mielikäinen, Esko Ukkonen
COLING
2010
13 years 1 months ago
Learning Web Query Patterns for Imitating Wikipedia Articles
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...
Shohei Tanaka, Naoaki Okazaki, Mitsuru Ishizuka
RTSS
2003
IEEE
13 years 11 months ago
Quick-release Fair Scheduling
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...
James H. Anderson, Aaron Block, Anand Srinivasan
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
CP
2008
Springer
13 years 7 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
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...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...