79 search results - page 5 / 16 » Linear programming bounds for unitary space time codes |
SPAA
2009
ACM
15 years 2 months ago
2009
ACM
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
IPL
2010
14 years 8 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
IJCAI
2007
14 years 11 months ago
2007
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...