Sciweavers

33 search results - page 4 / 7
» Use Fewer Instances of the Letter
Sort
View
EWC
2007
93views more  EWC 2007»
13 years 8 months ago
Approximation of involute curves for CAD-system processing
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa,...
CCECE
2006
IEEE
14 years 2 months ago
FPGA-Based SAT Solver
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
Mona Safar, M. Watheq El-Kharashi, Ashraf Salem
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
14 years 2 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
INFOCOM
2008
IEEE
14 years 3 months ago
All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching
—All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital exp...
Fernando Solano, Ruth van Caenegem, Didier Colle, ...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
14 years 2 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño