1884 search results - page 228 / 377 » Simple Algorithm for Simple Timed Games |
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
211
click to vote
BSDCON
2003
15 years 7 months ago
2003
The existing thread scheduler in FreeBSD was well suited towards the computing environment that it was developed in. As the priorities and hardware targets of the project have cha...
167
Voted
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
151
click to vote
SIGIR
1998
ACM
15 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
159
click to vote
SIGMETRICS
2005
ACM
15 years 11 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...