2583 search results - page 167 / 517 » On the Representation of Timed Polyhedra |
161
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
158
click to vote
AAAI
2007
15 years 8 months ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
151
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. While some recent frameworks on cognitive agents addressed the combination of mental attitudes with deontic concepts, they commonly ignore the representation of time. An ...
167
click to vote
ANLP
2000
15 years 7 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
176
click to vote
IJCAI
1993
15 years 7 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...