2194 search results - page 70 / 439 » Improving HLRTA*( k ) |
129
Voted
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
130
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalize...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
109
click to vote
JSS
2007
14 years 11 months ago
2007
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
108
click to vote
ECCC
2010
14 years 10 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...