7129 search results - page 346 / 1426 » Approximation Algorithms for Treewidth |
151
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
160
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
138
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Cultured natural cortical neurons form functional networks through a complex set of developmental steps during the first weeks in vitro. The dynamic behavior of the network in...
165
click to vote
CGF
2008
15 years 4 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
110
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...