1263 search results - page 71 / 253 » A* with Bounded Costs |
MLQ
1998
14 years 9 months ago
1998
We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of “measure 0 set” as considered before by Martin-L¨of, Schnorr, and others. W...
JMMA
2010
14 years 4 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
172
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal o...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...