10289 search results - page 44 / 2058 » Standard bases in K |
126
click to vote
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
126
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
108
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
156
click to vote
DASFAA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
125
click to vote
IPL
1998
15 years 1 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...