7167 search results - page 685 / 1434 » Answer Set Programming |
157
Voted
IJRR
2008
15 years 6 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
188
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
135
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
180
Voted
JAIR
2006
15 years 6 months ago
2006
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
254
click to vote
JODS
2008
15 years 6 months ago
2008
Information integration and retrieval are useful tasks in many information systems. In these systems, it is far from an easy task to directly integrate information from natural lan...