182 search results - page 3 / 37 » Versions of Simple and Composite Objects |
CSR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
ACSC
2005
IEEE
13 years 11 months ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
ANOR
2011
12 years 9 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
LPAR
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...