Sciweavers

2612 search results - page 471 / 523
» Switching Graphs and Their Complexity
Sort
View
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 8 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
ENTCS
2008
95views more  ENTCS 2008»
13 years 8 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
13 years 8 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
BMCBI
2006
164views more  BMCBI 2006»
13 years 8 months ago
BIOZON: a system for unification, management and analysis of heterogeneous biological data
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
Aaron Birkland, Golan Yona
CAL
2006
13 years 8 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani