Sciweavers

6719 search results - page 1178 / 1344
» A Generalization of Automatic Sequences
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 11 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
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
15 years 11 months ago
IMAD: in-execution malware analysis and detection
The sophistication of computer malware is becoming a serious threat to the information technology infrastructure, which is the backbone of modern e-commerce systems. We, therefore...
Syed Bilal Mehdi, Ajay Kumar Tanwani, Muddassar Fa...
MEMBRANE
2009
Springer
15 years 11 months ago
A Look Back at Some Early Results in Membrane Computing
em is a computing model, which abstracts from the way the living cells process chemical compounds in their compartmental structure. The regions defined by a membrane structure con...
Oscar H. Ibarra
SSS
2009
Springer
15 years 11 months ago
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
Damien Imbs, Michel Raynal
172
Voted
PETRA
2009
ACM
15 years 11 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
« Prev « First page 1178 / 1344 Last » Next »