Sciweavers

11371 search results - page 95 / 2275
» The network inhibition problem
Sort
View
NETWORKS
2008
15 years 6 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
ICCS
2007
Springer
16 years 29 days ago
An Heuristic Method for GPS Surveying Problem
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
Stefka Fidanova
IPSN
2003
Springer
16 years 10 hour ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter
CDC
2008
IEEE
130views Control Systems» more  CDC 2008»
16 years 1 months ago
Stochastic multiscale approaches to consensus problems
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
AUSAI
2004
Springer
16 years 6 days ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...