Sciweavers

1439 search results - page 56 / 288
» Fast approximation of centrality
Sort
View
ANSS
2005
IEEE
15 years 6 months ago
Approximation of Discrete Phase-Type Distributions
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
Claudia Isensee, Graham Horton
84
Voted
NIPS
2000
15 years 2 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck
85
Voted
ICRA
2007
IEEE
188views Robotics» more  ICRA 2007»
15 years 7 months ago
The Corridor Map Method: Real-Time High-Quality Path Planning
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
Roland Geraerts, Mark H. Overmars
94
Voted
ATAL
2007
Springer
15 years 4 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
116
Voted
CCCG
2010
15 years 2 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...