6320 search results - page 202 / 1264 » Towards Situated Computing |
176
click to vote
AFRICACRYPT
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
187
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
159
click to vote
AIIDE
2008
15 years 8 months ago
2008
We introduce the ALeRT (Action-dependent Learning Rates with Trends) algorithm that makes two modifications to the learning rate and one change to the exploration rate of traditio...
195
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
We apply XCS with computed prediction (XCSF) to tackle multistep reinforcement learning problems involving continuous inputs. In essence we use XCSF as a method of generalized rein...
187
click to vote
AIPS
2009
15 years 7 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...