22 search results - page 5 / 5 » Periodicity based decidable classes in a first order timed l... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...