1132 search results - page 143 / 227 » Structural Average Case Complexity |
WADT
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. Hidden algebra is a behavioural algebraic specification formalism for objects. It captures their constructional aspect, concerned with the initialisation and evolution of...
AI50
2006
14 years 25 days ago
2006
Abstract. This article discusses the issues of adaptive autonomous navigation as a challenge of artificial intelligence. We argue that, in order to enhance the dexterity and adapti...
AIIA
1991
Springer
14 years 18 days ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
AAAI
2010
13 years 10 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
CATS
2008
13 years 10 months ago
2008
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...