Sciweavers

1578 search results - page 170 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
PODC
2010
ACM
14 years 2 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ESANN
2007
13 years 11 months ago
Exploring the causal order of binary variables via exponential hierarchies of Markov kernels
Abstract. We propose a new algorithm for estimating the causal structure that underlies the observed dependence among n (n ≥ 4) binary variables X1, . . . , Xn. Our inference pri...
Xiaohai Sun, Dominik Janzing
TSMC
2011
258views more  TSMC 2011»
13 years 5 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
NOMS
2006
IEEE
146views Communications» more  NOMS 2006»
14 years 4 months ago
BGP-Inspect - Extracting Information from Raw BGP Data
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
Dionysus Blazakis, Manish Karir, John S. Baras
WINET
2011
13 years 5 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu