Sciweavers

270 search results - page 41 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo
EOR
2006
104views more  EOR 2006»
13 years 7 months ago
Financial networks with intermediation: Risk management with variable weights
: In this paper, we develop a framework for the modeling, analysis, and computation of solutions to multitiered financial network problems with intermediaries in which both the sou...
Anna Nagurney, Ke Ke
JVCA
2006
140views more  JVCA 2006»
13 years 7 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
PAMI
2010
192views more  PAMI 2010»
13 years 6 months ago
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
Carlos Alzate, Johan A. K. Suykens
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
13 years 2 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...