74 search results - page 6 / 15 » The Emptiness Problem for Tree Automata with Global Constrai... |
107
Voted
AAAI
2004
15 years 1 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
109
Voted
DLT
2007
15 years 1 months ago
2007
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
110
Voted
ICMLA
2010
14 years 9 months ago
2010
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
107
Voted
ATVA
2004
Springer
15 years 5 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
111
Voted
DAC
1998
ACM
15 years 3 months ago
1998
ACM
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...