Sciweavers

741 search results - page 22 / 149
» Robust Constraint Solving Using Multiple Heuristics
Sort
View
PROCEDIA
2011
13 years 20 days ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
MANSCI
2008
128views more  MANSCI 2008»
13 years 9 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...
ATAL
2005
Springer
14 years 3 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
AIPS
2007
14 years 4 days ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 8 months ago
Multiple relative pose graphs for robust cooperative mapping
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
Been Kim, Michael Kaess, Luke Fletcher, John J. Le...