Sciweavers

2157 search results - page 60 / 432
» Binary ant algorithm
Sort
View
199
Voted
NABIC
2010
14 years 7 months ago
Regional ACO-based routing for load-balancing in NoC systems
Abstract--Ant Colony Optimization (ACO) is a problemsolving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-o...
Hsien-Kai Hsin, En-Jui Chang, Chih-Hao Chao, An-Ye...
127
Voted
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 3 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
98
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
89
Voted
ACSD
2003
IEEE
91views Hardware» more  ACSD 2003»
15 years 5 months ago
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
Javier Esparza