3653 search results - page 173 / 731 » On Recognizable Timed Languages |
197
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
142
Voted
ECOOP
2007
Springer
15 years 9 months ago
2007
Springer
Current refactoring tools work on a particular language. Each time it is intended to provide refactoring support for new languages, the same refactoring operations are defined and...
279
click to vote
SBIA
2010
Springer
15 years 3 months ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
199
click to vote
ICFP
2012
ACM
13 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
154
click to vote
UM
2001
Springer
15 years 9 months ago
2001
Springer
In an experimental environment, we simulated the situation of a user who gives speech input to a system while walking through an airport. The time pressure on the subjects and the ...