Sciweavers

3082 search results - page 413 / 617
» New Bounds for the Controller Problem
Sort
View
MTA
2007
79views more  MTA 2007»
15 years 5 months ago
Periodic broadcast with dynamic server selection
Abstract—Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server ...
Ewa Kusmierek, Yingping Lu, David Hung-Chang Du
CP
2009
Springer
15 years 4 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
ICIP
2009
IEEE
15 years 3 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré
JDA
2011
90views more  JDA 2011»
15 years 1 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
KI
2010
Springer
15 years 29 days ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...