1445 search results - page 121 / 289 » Uniformly Hard Languages |
128
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
157
click to vote
AAAI
2007
15 years 6 months ago
2007
Much work has been done on building a parser for natural languages, but most of this work has concentrated on supervised parsing. Unsupervised parsing is a less explored area, and...
119
click to vote
IESA
2007
15 years 5 months ago
2007
The application of model-driven development facilitates faster and more flexible integration by separating system descriptions to different levels of abstraction. In crossorganisat...
121
click to vote
DLOG
2003
15 years 5 months ago
2003
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the empti...
137
click to vote
SFP
2000
15 years 5 months ago
2000
Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...