4047 search results - page 426 / 810 » Some Properties and Some Problems on Set Functors |
223
click to vote
AAAI
2012
13 years 9 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
176
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
194
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
220
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
199
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...