2107 search results - page 91 / 422 » Computing Small Search Numbers in Linear Time |
127
click to vote
WOB
2003
15 years 4 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
123
click to vote
VLSID
2003
IEEE
16 years 3 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
141
Voted
AIPS
2006
15 years 4 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
118
click to vote
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
130
click to vote
ACIVS
2006
Springer
15 years 9 months ago
2006
Springer
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...