Sciweavers

5114 search results - page 676 / 1023
» Complex networks
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
NCA
2010
IEEE
15 years 1 months ago
Composable continuous-space programs for robotic swarms
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
Jonathan Bachrach, Jacob Beal, James McLurkin
IJKSR
2011
106views more  IJKSR 2011»
14 years 10 months ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
16 years 1 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
RTAS
2005
IEEE
16 years 10 days ago
Applying Sensitivity Analysis in Real-Time Distributed Systems
During real-world design of embedded real-time systems, it cannot be expected that all performance data required for scheduling analysis is fully available up front. In such situa...
Razvan Racu, Marek Jersak, Rolf Ernst