Sciweavers

791 search results - page 78 / 159
» Approximating the Maximum Sharing Problem
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
ATAL
2001
Springer
14 years 8 days ago
Evolving Real-Time Local Agent Control for Large-Scale Multi-agent Systems
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
Thomas Wagner, Victor R. Lesser
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
RTSS
2003
IEEE
14 years 1 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan
LCN
2002
IEEE
14 years 20 days ago
Optimization of AP Placement and Channel Assignment in Wireless LANs
—The design of a wireless local area network (WLAN) has an important issue of determining the optimal placement of access points (APs) and assignment of channels to them. WLAN se...
Youngseok Lee, Kyoungae Kim, Yanghee Choi