Sciweavers

4908 search results - page 43 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
JDCTA
2010
272views more  JDCTA 2010»
15 years 27 days ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
ICASSP
2011
IEEE
14 years 9 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ļ...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...
DCOSS
2011
Springer
14 years 5 months ago
A distributed information fusion method for localization based on Pareto optimization
—To overcome the limitations of specific positioning techniques for mobile wireless nodes and achieve a high accuracy, the fusion of heterogeneous sensor information is an appea...
Alessio De Angelis, Carlo Fischione