Sciweavers

2479 search results - page 311 / 496
» Quantum complexity theory
Sort
View
JAIR
2010
115views more  JAIR 2010»
15 years 5 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
MST
2010
140views more  MST 2010»
15 years 5 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
SAB
2010
Springer
140views Optimization» more  SAB 2010»
15 years 5 months ago
A Model of Symmetry Breaking in Collective Decision-Making
Abstract. Symmetry breaking is commonly found in self-organized collective decision making. It serves an important functional role, specifically in biological and bio-inspired sys...
Heiko Hamann, Bernd Meyer, Thomas Schmickl, Karl C...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
TCS
2011
15 years 1 months ago
Optimizing n-variate (n+k)-nomials for small k
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
Philippe P. Pébay, J. Maurice Rojas, David ...