2926 search results - page 110 / 586 » Partially Optimal Routing |
91
Voted
DATE
1998
IEEE
15 years 5 months ago
1998
IEEE
Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several ...
114
Voted
AAAI
2004
15 years 2 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
104
click to vote
PR
2007
15 years 10 days ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
122
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
MINENET
2005
ACM
15 years 6 months ago
2005
ACM
BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. The updates logged by ...