10890 search results - page 202 / 2178 » Automatic Complexity Analysis |
164
click to vote
ECAL
2001
Springer
15 years 11 months ago
2001
Springer
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
165
click to vote
ICMLA
2007
15 years 8 months ago
2007
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
145
click to vote
NDQA
2004
15 years 7 months ago
2004
This paper illustrates ongoing research and issues faced when dealing with real-time questions in the domain of Reusable Launch Vehicles (aerospace engineering). The question-answ...
163
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
167
click to vote
ACL
2010
15 years 4 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...