Sciweavers

1322 search results - page 188 / 265
» Parameterized counting problems
Sort
View
144
Voted
TAPSOFT
1995
Springer
15 years 7 months ago
Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
Hanne Riis Nielson, Flemming Nielson
131
Voted
CONEXT
2007
ACM
15 years 5 months ago
Detecting worm variants using machine learning
Network intrusion detection systems typically detect worms by examining packet or flow logs for known signatures. Not only does this approach mean worms cannot be detected until ...
Oliver Sharma, Mark Girolami, Joseph S. Sventek
129
Voted
ATMOS
2007
114views Optimization» more  ATMOS 2007»
15 years 5 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
150
Voted
FIMI
2003
210views Data Mining» more  FIMI 2003»
15 years 5 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
111
Voted
IJCAI
2003
15 years 5 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...