Sciweavers

10890 search results - page 1717 / 2178
» Automatic Complexity Analysis
Sort
View
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 7 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
SIGMOD
2008
ACM
179views Database» more  SIGMOD 2008»
16 years 7 months ago
BibNetMiner: mining bibliographic information networks
Online bibliographic databases, such as DBLP in computer science and PubMed in medical sciences, contain abundant information about research publications in different fields. Each...
Yizhou Sun, Tianyi Wu, Zhijun Yin, Hong Cheng, Jia...
CSFW
2009
IEEE
16 years 1 months ago
Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities
—As networked systems grow in complexity, they are increasingly vulnerable to denial-of-service (DoS) attacks involving resource exhaustion. A single malicious input of coma can ...
Richard M. Chang, Guofei Jiang, Franjo Ivancic, Sr...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 1 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
« Prev « First page 1717 / 2178 Last » Next »