Sciweavers

16596 search results - page 165 / 3320
» Generalized Assignment Problems
Sort
View
CONEXT
2006
ACM
15 years 8 months ago
SMARTA: a self-managing architecture for thin access points
Optimally choosing operating parameters for access points in an enterprise wireless LAN environment is a difficult and well-studied problem. Unlike past work, the SMARTA self-man...
Nabeel Ahmed, Srinivasan Keshav
119
Voted
ACSAC
2003
IEEE
15 years 7 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...
112
Voted
INFOCOM
1997
IEEE
15 years 6 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
IJCAI
2007
15 years 3 months ago
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 2 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...