Sciweavers

129 search results - page 12 / 26
» arcs 2010
Sort
View
ARCS
2010
Springer
14 years 4 months ago
Exploiting Inactive Rename Slots for Detecting Soft Errors
Register renaming is a widely used technique to remove false data dependencies in superscalar datapaths. Rename logic consists of a table that holds a physical register mapping for...
Mehmet Kayaalp, Oguz Ergin, Osman S. Ünsal, M...
JMLR
2010
134views more  JMLR 2010»
13 years 4 months ago
Bayesian Algorithms for Causal Data Mining
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...
Subramani Mani, Constantin F. Aliferis, Alexander ...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 10 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 9 months ago
A Translational Approach to Constraint Answer Set Solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
Christian Drescher, Toby Walsh
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 7 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu