Sciweavers

958 search results - page 39 / 192
» Resolving the Micropayment Problem
Sort
View
IAT
2003
IEEE
15 years 3 months ago
Discrete Bee Dance Algorithms for Pattern Formation on a Grid
This paper presents a solution to the problem of pattern formation on a grid, for a group of identical autonomous robotic agents, that have very limited communication capabilities...
Noam Gordon, Israel A. Wagner, Alfred M. Bruckstei...
EUROCRYPT
2006
Springer
15 years 1 months ago
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...
Mihir Bellare, Phillip Rogaway
GECCO
2006
Springer
237views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic algorithms to optimise the time to make stock market investment
The application of Artificial Intelligence described in this article is intended to resolve the issue of speculation on the stock market. Genetic Algorithms is the technique that ...
David de la Fuente, Alejandro Garrido, Jaime Lavia...
CG
2008
Springer
14 years 12 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
DATESO
2007
103views Database» more  DATESO 2007»
14 years 11 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth