6020 search results - page 143 / 1204 » A New Approach to Model Counting |
224
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
149
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
136
click to vote
ALENEX
2004
15 years 5 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
141
Voted
INAP
2001
Springer
15 years 8 months ago
2001
Springer
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
126
click to vote
RAID
1999
Springer
15 years 8 months ago
1999
Springer
The most common computer intrusion detection systems detect signatures of known attacks by searching for attack-specific keywords in network traffic. Many of these systems suffer ...