8437 search results - page 138 / 1688 » Preferences over Sets |
174
click to vote
DLT
2009
15 years 4 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
144
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
106
click to vote
JCT
2008
15 years 6 months ago
2008
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
141
click to vote
DM
2011
15 years 1 months ago
2011
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analo...
186
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...