3894 search results - page 159 / 779 » Approximation Algorithms for Biclustering Problems |
166
click to vote
TCC
2007
Springer
16 years 17 days 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 ...
191
click to vote
COCOON
2005
Springer
16 years 1 hour ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
146
click to vote
AAMAS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
179
click to vote
WADS
2007
Springer
16 years 17 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
176
click to vote
WAOA
2007
Springer
16 years 17 days ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...