464 search results - page 5 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
CHI
2011
ACM
12 years 10 months ago
2011
ACM
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
AIPS
2010
13 years 9 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
ICCS
2005
Springer
14 years 6 days ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...