Sciweavers

1795 search results - page 263 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
107
Voted
ISPD
2007
ACM
116views Hardware» more  ISPD 2007»
15 years 2 months ago
A morphing approach to address placement stability
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
Philip Chong, Christian Szegedy
CAINE
2003
15 years 2 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
105
Voted
AAAI
2000
15 years 2 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
86
Voted
WSC
1998
15 years 2 months ago
SEAMS: Simulation Environment for VHDL-AMS
VHDL-AMS is an Analog and Mixed-Signal extension to the Very High Speed Integrated Circuit Hardware Description Language (VHDL). With the standardization of VHDL-AMS, capable and ...
Peter Frey, Kathiresan Nellayappan, Vasudevan Sahn...
86
Voted
CIIA
2009
15 years 1 months ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci