Sciweavers

2740 search results - page 266 / 548
» Approximating Component Selection
Sort
View
131
Voted
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
15 years 7 months ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...
Huey-Yih Wang, Robert K. Brayton
135
Voted
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 7 months ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha
119
Voted
ANCS
2008
ACM
15 years 5 months ago
Performing time-sensitive network experiments
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick...
129
Voted
IC
2007
15 years 5 months ago
Gordon Surface Modeling in a Network Environment
—With the advent of the Internet, we have entered the age of ubiquitous systems that will need to be able to communicate, establish criteria for measurement and then perform thes...
Jan Smid, Petr Volf
113
Voted
DAGSTUHL
2003
15 years 5 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...