Sciweavers

15254 search results - page 9 / 3051
» A k
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
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 ...
Peng Dai, Judy Goldsmith
DAM
2010
81views more  DAM 2010»
13 years 7 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
JSAT
2006
94views more  JSAT 2006»
13 years 7 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
PRDC
2007
IEEE
14 years 1 months ago
Failure Detectors and Extended Paxos for k-Set Agreement
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
14 years 26 days ago
Improved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...