Sciweavers

1434 search results - page 103 / 287
» Graph Searching with Advice
Sort
View
134
Voted
TCS
2008
15 years 3 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
134
Voted
CEC
2009
IEEE
15 years 10 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
136
Voted
COMCOM
2006
88views more  COMCOM 2006»
15 years 3 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
ECAI
2004
Springer
15 years 9 months ago
Planning with Numerical Expressions in LPG
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
103
Voted
EOR
2006
57views more  EOR 2006»
15 years 3 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro