Sciweavers

2006 search results - page 100 / 402
» Heuristic Security-Testing Methods
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 5 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
107
Voted
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 5 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo
111
Voted
WSC
2007
15 years 3 months ago
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...
Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean...
101
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
ICIAP
2003
ACM
16 years 23 days ago
Smart interpolation by anisotropic diffusion
To be able to enlarge a digital image from a single frame preserving the perceptive cues is a relevant research issue. The best algorithms take into account the presence of edges ...
Sebastiano Battiato, Giovanni Gallo, Filippo Stanc...