Sciweavers

2634 search results - page 108 / 527
» Faster Than Uppaal
Sort
View
IBERAMIA
2010
Springer
13 years 7 months ago
Dynamic Reward Shaping: Training a Robot by Voice
Reinforcement Learning is commonly used for learning tasks in robotics, however, traditional algorithms can take very long training times. Reward shaping has been recently used to ...
Ana C. Tenorio-Gonzalez, Eduardo F. Morales, Luis ...
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
13 years 7 months ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan
ECCV
2010
Springer
13 years 6 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
COLING
2010
13 years 4 months ago
2D Trie for Fast Parsing
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
Xian Qian, Qi Zhang, Xuanjing Huang, Lide Wu
DCC
2011
IEEE
13 years 3 months ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...