Sciweavers

154 search results - page 24 / 31
» Using Proofs by Coinduction to Find
Sort
View
RTSS
2007
IEEE
15 years 6 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
HPCC
2007
Springer
15 years 5 months ago
On Pancyclicity Properties of OTIS Networks
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
Mohammad R. Hoseinyfarahabady, Hamid Sarbazi-Azad
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 11 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
MOR
2006
81views more  MOR 2006»
14 years 11 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
DLOG
2009
14 years 9 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph