1139 search results - page 11 / 228 » Bounded Ideation Theory |
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
LOGCOM
2007
13 years 7 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
NFM
2011
13 years 2 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...