4894 search results - page 223 / 979 » Choices |
187
click to vote
JAIR
2008
15 years 7 months ago
2008
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple win...
211
click to vote
JCT
2006
15 years 7 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
184
click to vote
JDA
2006
15 years 7 months ago
2006
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
187
click to vote
ENTCS
2007
15 years 7 months ago
2007
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
152
click to vote
MLQ
2008
15 years 7 months ago
2008
We show that there is a model of ZF in which the Borel hierarchy on the reals has length 2. This implies that 1 has countable cofinality, so the axiom of choice fails very badly i...