Sciweavers

2302 search results - page 249 / 461
» Basic Description Logics
Sort
View
CONPAR
1992
15 years 10 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
AAAI
1994
15 years 7 months ago
Formalizing Ontological Commitment
Formalizing the ontological commitment of a logical language means offering a way to specify the intended meaning of its vocabulary by constraining the set of its models, giving e...
Nicola Guarino, Massimiliano Carrara, Pierdaniele ...
GPEM
2006
89views more  GPEM 2006»
15 years 5 months ago
Morphological algorithm design for binary images using genetic programming
This paper presents a Genetic Programming (GP) approach to the design of Mathematical Morphology (MM) algorithms for binary images. The algorithms are constructed using logic opera...
Marcos I. Quintana, Riccardo Poli, Ela Claridge
TODS
2012
13 years 8 months ago
A survey of B-tree logging and recovery techniques
B-trees have been ubiquitous in database management systems for several decades, and they serve in many other storage systems as well. Their basic structure and their basic operat...
Goetz Graefe
AAAI
2007
15 years 8 months ago
An Investigation into Computational Recognition of Children's Jokes
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
Julia M. Taylor, Lawrence J. Mazlack