Sciweavers

559 search results - page 95 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
AAAI
2010
13 years 10 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
TSP
2010
13 years 3 months ago
Power allocation for a MIMO relay system with multiple-antenna users
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
Yuan Yu, Yingbo Hua
IJCAI
1997
13 years 10 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 7 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
APLAS
2000
ACM
14 years 1 months ago
Kima - An Automated Error Correction System for Concurrent Logic Programs
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
Yasuhiro Ajiro, Kazunori Ueda