6320 search results - page 376 / 1264 » Towards Situated Computing |
199
click to vote
COCO
1995
Springer
15 years 10 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
177
click to vote
FLAIRS
2008
15 years 9 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
191
click to vote
COMMA
2006
15 years 8 months ago
2006
Abstract. This paper presents our efforts to create argument structures from meeting transcripts automatically. We show that unit labels of argument diagrams can be learnt and pred...
187
click to vote
PDSE
1998
15 years 8 months ago
1998
With the advancement in network speed and computing power; distributed multimedia applications are becoming populal: However;generalprinciples of system testing cannot be directly...
180
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
Classifying objects in computer vision, we are faced with a great many features one can use. This paper argues that diagrammatic representations help to comprehend properties of fe...