Sciweavers

12783 search results - page 2388 / 2557
» Experimenting with computing
Sort
View
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 5 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
EUROSYS
2006
ACM
16 years 1 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
15 years 10 months ago
An empirical study on the handling of overlapping solutions in evolutionary multiobjective optimization
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
Hisao Ishibuchi, Kaname Narukawa, Yusuke Nojima
GECCO
2004
Springer
112views Optimization» more  GECCO 2004»
15 years 10 months ago
Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
Hisao Ishibuchi, Kaname Narukawa
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 10 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
« Prev « First page 2388 / 2557 Last » Next »