Sciweavers

6365 search results - page 389 / 1273
» Fast Local Computation Algorithms
Sort
View
PPSN
2010
Springer
15 years 5 months ago
First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...
Gabriela Ochoa, Sébastien Vérel, Mar...
ISBI
2008
IEEE
16 years 7 months ago
Improving single particle localization with an empirically calibrated Gaussian kernel
Accurate computational localization of single fluorescent particles is of interest to many biophysical studies and underlies recent approaches to high resolution microscopy using ...
Marcio de Moraes Marim, Bo Zhang, Jean-Christophe ...
SAC
2004
ACM
16 years 7 days ago
Concatenate feature extraction for robust 3D elliptic object localization
Developing an efficient object localization system for complicated industrial objects is an important, yet difficult robotic task. To tackle this problem, we have developed a syst...
Yuichi Motai, Akio Kosaka
UAI
1993
15 years 8 months ago
Using Causal Information and Local Measures to Learn Bayesian Networks
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
Wai Lam, Fahiem Bacchus
COR
2008
99views more  COR 2008»
15 years 6 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi