Sciweavers

344 search results - page 21 / 69
» On the Discrete Symmetric Localization Problem
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
80
Voted
ECCV
2010
Springer
15 years 3 months ago
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
TIME
2002
IEEE
15 years 3 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
ICNC
2009
Springer
15 years 2 months ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie
IPSN
2003
Springer
15 years 3 months 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