Sciweavers

474 search results - page 31 / 95
» Computing integral solutions of complementarity problems
Sort
View
PRL
2006
105views more  PRL 2006»
14 years 9 months ago
Parisian camera placement for vision metrology
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
HYBRID
2009
Springer
15 years 4 months ago
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
Gunther Reißig
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
14 years 11 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 8 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther