976 search results - page 126 / 196 » The Complexity of Timetable Construction Problems |
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
BPM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Business process (BP) modeling is a building block for design and management of business processes. Two fundamental aspects of BP modeling are: a formal framework that we...