Sciweavers

85 search results - page 6 / 17
» Combinatorial algorithms for fast clock mesh optimization
Sort
View
FSE
1997
Springer
131views Cryptology» more  FSE 1997»
13 years 12 months ago
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
Bruce Schneier, Doug Whiting
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
14 years 29 days ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
IPPS
1999
IEEE
14 years 6 hour ago
Better Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
Jop F. Sibeyn
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 15 days ago
A genetic algorithm to improve linux kernel performance on resource-constrained devices
As computers become increasingly mobile, users demand more functionality, longer battery-life, and better performance from mobile devices. In response, chipset fabricators are foc...
James Kukunas, Robert D. Cupper, Gregory M. Kapfha...
CGI
2000
IEEE
14 years 4 days ago
SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...
Renato Pajarola, Jarek Rossignac