Join Our Newsletter

DLOG

2011

5 years 9 months ago
2011

We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...

CORR

2010

Springer

6 years 3 months ago
2010

Springer

Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2

COCOA

2010

Springer

6 years 3 months ago
2010

Springer

In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...

TCOS

2010

6 years 4 months ago
2010

We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...

SAGT

2010

Springer

6 years 4 months ago
2010

Springer

The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...

RC

2007

6 years 5 months ago
2007

Linear systems whose coeﬃcients have large uncertainties arise routinely in ﬁnite element calculations for structures with uncertain geometry, material properties, or loads. Ho...

SIAMCOMP

2002

6 years 5 months ago
2002

Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...

ENTCS

2002

6 years 5 months ago
2002

We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...

AUTOMATICA

2004

6 years 5 months ago
2004

: In this paper we consider the problem of controlling a multi

GC

2006

Springer

6 years 5 months ago
2006

Springer

It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...