Sciweavers

10718 search results - page 379 / 2144
» On the Circuit Implementation Problem
Sort
View
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 8 days ago
Interconnect design methods for memory design
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
Chanseok Hwang, Massoud Pedram
COR
2006
99views more  COR 2006»
15 years 6 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
168
Voted
CHES
1999
Springer
91views Cryptology» more  CHES 1999»
15 years 11 months ago
A High-Performance Flexible Architecture for Cryptography
Cryptographic algorithms are more efficiently implemented in custom hardware than in software running on general-purpose processors. However, systems which use hardware implementat...
R. Reed Taylor, Seth Copen Goldstein
AI
2006
Springer
15 years 7 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
16 years 1 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska