3653 search results - page 354 / 731 » On Recognizable Timed Languages |
214
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
164
click to vote
CP
2007
Springer
16 years 29 days ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
178
click to vote
CP
2004
Springer
16 years 5 days ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
180
click to vote
ITS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
185
click to vote
CSFW
2003
IEEE
16 years 2 days ago
2003
IEEE
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...