2911 search results - page 530 / 583 » A Logic of Graph Constraints |
UAI
2003
14 years 16 days ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
DEXA
2010
Springer
13 years 11 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
ALGORITHMICA
2006
13 years 11 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
COMCOM
2006
13 years 11 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...