Sciweavers

3367 search results - page 337 / 674
» Incremental assignment problem
Sort
View
ACSAC
2003
IEEE
15 years 10 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
INFOCOM
1997
IEEE
15 years 9 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
DALT
2007
Springer
15 years 8 months ago
Extending Propositional Logic with Concrete Domains for Multi-issue Bilateral Negotiation
We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
CAISE
2004
Springer
15 years 8 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
15 years 8 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe