395 search results - page 33 / 79 » Decision Problems for Convex Languages |
RISE
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
ACL
1998
15 years 1 months ago
1998
Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" int...
CONCUR
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
110
click to vote
JMLR
2012
13 years 2 months ago
2012
We study the problem of learning a group of principal tasks using a group of auxiliary tasks, unrelated to the principal ones. In many applications, joint learning of unrelated ta...