Sciweavers

14158 search results - page 481 / 2832
» Generalized switch-setting problems
Sort
View
COMPSAC
2002
IEEE
15 years 11 months ago
Expanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
Robert M. Hierons, T.-H. Kim, Hasan Ural
IV
1999
IEEE
109views Visualization» more  IV 1999»
15 years 10 months ago
2D Texture Refinement Using Procedural Functions
In Computer Graphics, aliasing is a problem which is always present when discrete elements are mapped to continuous functions or vice-versa. Although there is no general solution ...
Esteban Walter Gonzalez Clua, Marcelo Dreux, Marce...
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
15 years 10 months ago
Non-Standard Crossover for a Standard Representation - Commonality-Based Feature Subset Selection
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. ...
ICCAD
1996
IEEE
114views Hardware» more  ICCAD 1996»
15 years 10 months ago
An efficient approach to simultaneous transistor and interconnect sizing
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
Jason Cong, Lei He
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 10 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...