Sciweavers

487 search results - page 88 / 98
» The Java System Dependence Graph
Sort
View
CN
2004
114views more  CN 2004»
13 years 8 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
EUROPAR
2010
Springer
13 years 6 months ago
Starsscheck: A Tool to Find Errors in Task-Based Parallel Programs
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
FGCS
2011
123views more  FGCS 2011»
13 years 3 months ago
Mapping attribution metadata to the Open Provenance Model
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...
Simon Miles
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 2 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...