Sciweavers

13987 search results - page 335 / 2798
» The Two Guards Problem
Sort
View
PERCOM
2006
ACM
16 years 6 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho
CLUSTER
2006
IEEE
16 years 25 days ago
Robust task scheduling in non-deterministic heterogeneous computing systems
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
Zhiao Shi, Emmanuel Jeannot, Jack Dongarra
GCC
2003
Springer
15 years 12 months ago
An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
Ahmet Ünveren, Adnan Acan
JMLR
2008
108views more  JMLR 2008»
15 years 6 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng
JMLR
2010
128views more  JMLR 2010»
15 years 1 months ago
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...