Sciweavers

1844 search results - page 13 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
83
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 6 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
AAAI
2006
15 years 16 days ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
JAIR
2008
104views more  JAIR 2008»
14 years 11 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 11 months ago
Information Acquisition and Exploitation in Multichannel Wireless Networks
A wireless system with multiple channels is considered, where each channel has several transmission states. A user learns about the instantaneous state of an available channel by ...
Sudipto Guha, Kamesh Munagala, Saswati Sarkar
IPPS
2003
IEEE
15 years 4 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...