Sciweavers

575 search results - page 73 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 7 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
TVCG
2012
185views Hardware» more  TVCG 2012»
13 years 4 months ago
Interest Driven Navigation in Visualization
—This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that a...
Christopher G. Healey, Brent M. Dennis
CJ
2004
141views more  CJ 2004»
15 years 1 months ago
Modeling and Analysis of a Scheduled Maintenance System: a DSPN Approach
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
Andrea Bondavalli, Roberto Filippini
WINE
2005
Springer
179views Economy» more  WINE 2005»
15 years 7 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
AOSD
2009
ACM
15 years 4 months ago
Modular verification of dynamically adaptive systems
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
Ji Zhang, Heather Goldsby, Betty H. C. Cheng