184 search results - page 17 / 37 » Using FPGAs to solve the Hamiltonian cycle problem |
111
click to vote
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
DAC
2007
ACM
16 years 21 days ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
CPM
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
ANOR
2008
14 years 12 months ago
2008
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...