We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
Lidan Wang, Paul N. Bennett, Kevyn Collins-Thompso...
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...