1484 search results - page 139 / 297 » Ants meeting algorithms |
FLAIRS
2006
14 years 11 months ago
2006
Cognitive modeling has outgrown the toy problems of the research labs and is increasingly tackling Industrial size applications. This growth is not matched in terms of software to...
78
Voted
IJNSEC
2008
14 years 10 months ago
2008
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
ORL
1998
14 years 9 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a novel methodology for design space exploration using a two-steps scheme to optimize the number of virtual channel buffers (buffers take the premier share of the route...