Sciweavers

32 search results - page 4 / 7
» Crozzle: an NP-complete problem
Sort
View
ADHOCNOW
2010
Springer
13 years 5 months ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
TON
2012
11 years 9 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
ECAI
1998
Springer
13 years 11 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
CEC
2005
IEEE
13 years 9 months ago
Final exam scheduler - FES
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
Ender Özcan, Ersan Ersoy