Sciweavers

127 search results - page 17 / 26
» Some Parameterized Problems On Digraphs
Sort
View
ACMSE
2005
ACM
14 years 28 days ago
Metadata management and relational databases
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
Shun Yan Cheung, James J. Lu, Catharine M. Wyss
IEEEPACT
1998
IEEE
13 years 11 months ago
Scanning Polyhedra without Do-loops
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
Pierre Boulet, Paul Feautrier
ML
2002
ACM
168views Machine Learning» more  ML 2002»
13 years 7 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
FCT
2007
Springer
13 years 11 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
LPAR
2007
Springer
14 years 1 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki