Sciweavers

2020 search results - page 173 / 404
» Speeding up Slicing
Sort
View
ACTAC
2006
94views more  ACTAC 2006»
15 years 6 months ago
A Hierarchical Evaluation Methodology in Speech Recognition
In speech recognition vast hypothesis spaces are generated, so the search methods used and their speedup techniques are both of great importance. One way of getting a speedup gain...
Gábor Gosztolya, András Kocsor
IEICET
2008
147views more  IEICET 2008»
15 years 6 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
149
Voted
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
ESWA
2006
182views more  ESWA 2006»
15 years 6 months ago
Improved route planning and scheduling of waste collection and transport
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult ope...
Teemu Nuortio, Jari Kytöjoki, Harri Niska, Ol...
FGCS
2006
82views more  FGCS 2006»
15 years 6 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi