Sciweavers

14382 search results - page 2770 / 2877
» Time in Connectionist Models
Sort
View
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 3 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
AISADM
2005
Springer
14 years 3 months ago
Evolving Agents: Communication and Cognition
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
Leonid I. Perlovsky
ATAL
2005
Springer
14 years 3 months ago
Reasoning about joint beliefs for execution-time communication decisions
Just as POMDPs have been used to reason explicitly about uncertainty in single-agent systems, there has been recent interest in using multi-agent POMDPs to coordinate teams of age...
Maayan Roth, Reid G. Simmons, Manuela M. Veloso
CONCUR
2005
Springer
14 years 3 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
CP
2005
Springer
14 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
« Prev « First page 2770 / 2877 Last » Next »