7129 search results - page 301 / 1426 » Approximation Algorithms for Treewidth |
139
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
148
click to vote
ECRTS
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...
133
Voted
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
138
Voted
IJCAI
2003
15 years 6 months ago
2003
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
ECCC
2010
15 years 4 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...