Sciweavers

4114 search results - page 372 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
AAAI
2006
15 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
BMEI
2009
IEEE
15 years 7 months ago
A Kurtosis and Skewness Based Criterion for Model Selection on Gaussian Mixture
The Gaussian mixture model is a powerful statistical tool in data modeling and analysis. Generally, the EM algorithm is utilized to learn the parameters of the Gaussian mixture. Ho...
Lin Wang, Jinwen Ma
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
JGAA
2000
85views more  JGAA 2000»
15 years 6 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
JACM
2002
87views more  JACM 2002»
15 years 6 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi