Sciweavers

1599 search results - page 36 / 320
» Algorithms for Parity Games
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
14 years 11 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
15 years 5 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
CRV
2009
IEEE
156views Robotics» more  CRV 2009»
15 years 6 months ago
A Bayesian Algorithm for Reading 1D Barcodes
The 1D barcode is a ubiquitous labeling technology, with symbologies such as UPC used to label approximately 99% of all packaged goods in the US. It would be very convenient for c...
Ender Tekin, James Coughlan
ATAL
2006
Springer
15 years 3 months ago
On using multi-agent systems in playing board games
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
Stefan J. Johansson
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
15 years 4 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski