Sciweavers

3238 search results - page 397 / 648
» Not Enough Points Is Enough
Sort
View
CSL
2006
Springer
15 years 4 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets
151
Voted
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
15 years 4 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
102
Voted
ECAI
2006
Springer
15 years 4 months ago
Strategic Foresighted Learning in Competitive Multi-Agent Games
We describe a generalized Q-learning type algorithm for reinforcement learning in competitive multi-agent games. We make the observation that in a competitive setting with adaptive...
Pieter Jan't Hoen, Sander M. Bohte, Han La Poutr&e...
91
Voted
EDBTW
2006
Springer
15 years 4 months ago
Towards Similarity-Based Topological Query Languages
Abstract. In recent times, the proliferation of spatial data on the Internet is beginning to allow a much larger audience to access and share data currently available in various Ge...
Alberto Belussi, Omar Boucelma, Barbara Catania, Y...
94
Voted
EUC
2006
Springer
15 years 4 months ago
Scalable Message Routing for Mobile Software Assistants
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
Pawel T. Wojciechowski