2543 search results - page 179 / 509 » Optimal Ordered Problem Solver |
109
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
153
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
142
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
170
click to vote
BROADNETS
2006
IEEE
15 years 5 months ago
2006
IEEE
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
142
click to vote
AICCSA
2007
IEEE
15 years 9 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...