Sciweavers

524 search results - page 37 / 105
» ets 2010
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
AEI
2010
66views more  AEI 2010»
13 years 7 months ago
Ikaros: Building cognitive models for robots
The Ikaros project started in 2001 with the aim of developing an open infrastructure for system-level brain modeling. The system has developed into a general tool for cognitive mo...
Christian Balkenius, Jan Morén, Birger Joha...
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 6 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
LATINCRYPT
2010
13 years 5 months ago
Combined Implementation Attack Resistant Exponentiation
Different types of implementation attacks, like those based on side channel leakage and active fault injection, are often considered as separate threats. Countermeasures are, there...
Jörn-Marc Schmidt, Michael Tunstall, Roberto ...
ECCC
2010
108views more  ECCC 2010»
13 years 5 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...