Sciweavers

3208 search results - page 323 / 642
» A Lower Bound for Primality
Sort
View
186
Voted
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 11 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
RANDOM
2001
Springer
15 years 11 months ago
On Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala
CADE
1999
Springer
15 years 11 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies
173
Voted
CAISE
1999
Springer
15 years 11 months ago
Time Constraints in Workflow Systems
Time management is a critical component of workflow-based process management. Important aspects of time management include planning of workflow process execution in time, estimat...
Johann Eder, Euthimios Panagos, Michael Rabinovich
STACS
1999
Springer
15 years 11 months ago
An Optimal Competitive Strategy for Walking in Streets
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Christian Icking, Rolf Klein, Elmar Langetepe