Sciweavers

242 search results - page 12 / 49
» Provably Bounded Optimal Agents
Sort
View
JOTA
2010
117views more  JOTA 2010»
13 years 6 months ago
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
S. Sundhar Ram, Angelia Nedic, Venugopal V. Veerav...
IPPS
2006
IEEE
14 years 1 months ago
Optimal map construction of an unknown torus
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
Hanane Becha, Paola Flocchini
AAAI
2008
13 years 10 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
AAAI
2006
13 years 9 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 2 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...