Sciweavers

1030 search results - page 50 / 206
» Happenings
Sort
View
AAAI
2008
15 years 8 months ago
Optimal False-Name-Proof Voting Rules with Costly Voting
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...
Liad Wagman, Vincent Conitzer
AIPS
2007
15 years 8 months ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu
AIIDE
2008
15 years 8 months ago
Learning and Playing in Wubble World
Children do not learn the meanings of words from parsing and understanding gigabytes of text; instead meanings are learned from competent speakers who relate language to what'...
Wesley Kerr, Paul R. Cohen, Yu-Han Chang
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
15 years 8 months ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
APLAS
2005
ACM
15 years 8 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo