Sciweavers

13987 search results - page 6 / 2798
» The Two Guards Problem
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 9 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
APWEB
2011
Springer
12 years 11 months ago
SecGuard: Secure and Practical Integrity Protection Model for Operating Systems
Host compromise is a serious security problem for operating systems. Most previous solutions based on integrity protection models are difficult to use; on the other hand, usable i...
Ennan Zhai, Qingni Shen, Yonggang Wang, Tao Yang, ...
VMCAI
2005
Springer
14 years 1 months ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
14 years 1 months ago
Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
Stephen Kloder, Seth Hutchinson
VL
2002
IEEE
107views Visual Languages» more  VL 2002»
14 years 17 days ago
Reasoning about Many-to-Many Requirement Relationships in Spreadsheets
To help improve the reliability of spreadsheets created by end users, we are working to allow users to communicate the purpose and other underlying information about their spreads...
Laura Beckwith, Margaret M. Burnett, Curtis R. Coo...