Sciweavers

100 search results - page 17 / 20
» New complexity results for time-constrained dynamical optima...
Sort
View
IJCAI
2003
13 years 9 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
ICASSP
2011
IEEE
13 years 4 days ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
ISPD
1999
ACM
128views Hardware» more  ISPD 1999»
14 years 22 days ago
Transistor level micro-placement and routing for two-dimensional digital VLSI cell synthesis
There is an increasing need in modern VLSI designs for circuits implemented in high-performance logic families such as Cascode Voltage Switch Logic, Pass Transistor Logic, and dom...
Michael A. Riepe, Karem A. Sakallah
GLOBECOM
2008
IEEE
14 years 2 months ago
Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
Yongle Wu, Beibei Wang, K. J. Ray Liu, T. Charles ...
EOR
2008
106views more  EOR 2008»
13 years 8 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...