Sciweavers

10 search results - page 1 / 2
» Optimal 2-constraint satisfaction via sum-product algorithms
Sort
View
IPL
2006
89views more  IPL 2006»
13 years 11 months ago
Optimal 2-constraint satisfaction via sum-product algorithms
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...
Mikko Koivisto
SIGIR
2012
ACM
12 years 1 months ago
Robust ranking models via risk-sensitive optimization
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...
AI
1999
Springer
13 years 10 months ago
Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
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...
Onn Shehory, Sarit Kraus, Osher Yadgar
GLOBECOM
2006
IEEE
14 years 5 months ago
A Location-Based Vertical Handoff Decision Algorithm for Heterogeneous Mobile Networks
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...
Jie Zhang, Henry C. B. Chan, Victor C. M. Leung
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
14 years 5 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák