Sciweavers

10718 search results - page 455 / 2144
» On the Circuit Implementation Problem
Sort
View
EH
2003
IEEE
100views Hardware» more  EH 2003»
16 years 8 days ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 11 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
FCT
2007
Springer
15 years 8 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
AEI
2008
108views more  AEI 2008»
15 years 7 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
ENTCS
2006
105views more  ENTCS 2006»
15 years 7 months ago
Monte Carlo Methods for Process Algebra
We review the recently developed technique of Monte Carlo model checking and show how it can be applied to the implementation problem for I/O Automata. We then consider some open ...
Radu Grosu, Scott A. Smolka