17770 search results - page 43 / 3554 » A Generalization of Forward-Backward Algorithm |
AI
2003
Springer
15 years 2 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
INFOCOM
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
66
Voted
ATAL
2007
Springer
15 years 1 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
GBRPR
2007
Springer
15 years 1 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...