Sciweavers

13987 search results - page 3 / 2798
» The Two Guards Problem
Sort
View
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
14 years 2 months ago
Hardware synthesis from guarded atomic actions with performance specifications
We present a new hardware synthesis methodology for guarded atomic actions (or rules), which satisfies performance-related scheduling specifications provided by the designer. The ...
Daniel L. Rosenband
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 5 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick
ICCS
2003
Springer
13 years 11 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
Ana Paula Tomás, António Leslie Baju...
GG
2004
Springer
13 years 11 months ago
Model Checking Graph Transformations: A Comparison of Two Approaches
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
Arend Rensink, Ákos Schmidt, Dániel ...
COMPGEOM
2005
ACM
13 years 7 months ago
Guarding a terrain by two watchtowers
Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Ha...