417 search results - page 16 / 84 » Running Time Predictions for Factoring Algorithms |
88
Voted
TIT
2008
14 years 9 months ago
2008
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
115
click to vote
CCGRID
2007
IEEE
15 years 4 months ago
2007
IEEE
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
ADHOCNETS
2009
Springer
15 years 4 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
ANTS
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...