23 search results - page 4 / 5 » Graphs Without Large Complete Minors Are Quasi-Random |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
BMCBI
2010
13 years 7 months ago
2010
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
CPC
2002
13 years 7 months ago
2002
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
ICTAI
2000
IEEE
13 years 11 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...