6897 search results - page 937 / 1380 » Parallelization of Modular Algorithms |
231
click to vote
ACSD
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
222
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
189
click to vote
DAGSTUHL
2007
15 years 9 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
180
click to vote
AAAI
2004
15 years 9 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
152
click to vote
AAAI
1998
15 years 9 months ago
1998
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...