531 search results - page 53 / 107 » A Better Algorithm for Random k-SAT |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
AVBPA
2003
Springer
14 years 1 months ago
2003
Springer
This paper describes a novel framework for the Open World face recognition problem, where one has to provide for the Reject option. Based upon algorithmic randomness and transducti...
EUC
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...