Sciweavers

3415 search results - page 347 / 683
» Lower bounds on kernelization
Sort
View
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
171
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
ICCAD
1997
IEEE
106views Hardware» more  ICCAD 1997»
15 years 11 months ago
Accurate power estimation for large sequential circuits
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...
Joseph N. Kozhaya, Farid N. Najm