2273 search results - page 93 / 455 » On the Expressiveness and Complexity of ATL |
MKWI
2008
14 years 11 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
COLING
1996
14 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
117
click to vote
ICFP
2012
ACM
13 years 9 days ago
2012
ACM
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
CCIA
2007
Springer
15 years 4 months ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...