Sciweavers

511 search results - page 66 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
DATAMINE
2010
175views more  DATAMINE 2010»
14 years 9 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...
HPCC
2007
Springer
15 years 3 months ago
FROCM: A Fair and Low-Overhead Method in SMT Processor
Simultaneous Multithreading (SMT)[1][2] and chip multiprocessors (CMP) processors [3] have emerged as the mainstream computing platform in major market segments, including PC, serv...
Shuming Chen, Pengyong Ma
ICPP
1999
IEEE
15 years 1 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
ATMOS
2007
129views Optimization» more  ATMOS 2007»
14 years 11 months ago
Applied Railway Optimization in Production Planning at DSB S-tog - tasks, tools and challenges
Efficient public transportation is becoming increasingly vital for modern capitals. DSB S-tog a/s is the major supplier of rail traffic on the infrastructure of the city-rail netwo...
Jens Clausen
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...