Sciweavers

Share
DLOG
2011
3 years 6 days ago
Nominal Schemas for Integrating Rules and Description Logics
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...
Markus Krötzsch, Frederick Maier, Adila Alfa ...
CORR
2010
Springer
91views Education» more  CORR 2010»
3 years 6 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
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
Ioannis K. Paparrizos
COCOA
2010
Springer
3 years 6 months ago
Time Optimal Algorithms for Black Hole Search in Rings
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...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
TCOS
2010
3 years 7 months ago
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
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 ...
Ophir Setter, Micha Sharir, Dan Halperin
SAGT
2010
Springer
126views Game Theory» more  SAGT 2010»
3 years 7 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
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 ...
Paul W. Goldberg
RC
2007
45views more  RC 2007»
3 years 8 months ago
Linear Systems with Large Uncertainties, with Applications to Truss Structures
Linear systems whose coefficients have large uncertainties arise routinely in finite element calculations for structures with uncertain geometry, material properties, or loads. Ho...
Arnold Neumaier, Andrzej Pownuk
SIAMCOMP
2002
101views more  SIAMCOMP 2002»
3 years 8 months ago
On Binary Searching with Nonuniform Costs
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...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
ENTCS
2002
167views more  ENTCS 2002»
3 years 8 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
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...
Tadao Takaoka
AUTOMATICA
2004
67views more  AUTOMATICA 2004»
3 years 8 months ago
Guaranteed cost control for multi-inventory systems with uncertain demand
: In this paper we consider the problem of controlling a multi
Franco Blanchini, Stefano Miani, Franca Rinaldi
GC
2006
Springer
3 years 8 months ago
Alternating Paths along Axis-Parallel Segments
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...
Csaba D. Tóth
books