Sciweavers

13987 search results - page 260 / 2798
» The Two Guards Problem
Sort
View
STACS
2010
Springer
15 years 11 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
IROS
2009
IEEE
131views Robotics» more  IROS 2009»
15 years 11 months ago
Visual Place Categorization: Problem, dataset, and algorithm
Abstract— In this paper we describe the problem of Visual Place Categorization (VPC) for mobile robotics, which involves predicting the semantic category of a place from image me...
Jianxin Wu, Henrik I. Christensen, James M. Rehg
ATAL
2009
Springer
15 years 11 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
15 years 11 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
IPPS
2007
IEEE
15 years 10 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...