Sciweavers

1182 search results - page 157 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
148
Voted
AAAI
2011
14 years 2 months ago
Dual Decomposition for Marginal Inference
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
Justin Domke
133
Voted
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 9 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
113
Voted
CVPR
2012
IEEE
13 years 5 months ago
Improving multi-target tracking via social grouping
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...
Zhen Qin, Christian R. Shelton
JCP
2006
151views more  JCP 2006»
15 years 2 months ago
Simulated Annealing based Wireless Sensor Network Localization
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
129
Voted
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 3 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou