Sciweavers

6897 search results - page 503 / 1380
» Parallelization of Modular Algorithms
Sort
View
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
15 years 10 months ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
DATE
2010
IEEE
124views Hardware» more  DATE 2010»
15 years 10 months ago
Control network generator for latency insensitive designs
—Creating latency insensitive or asynchronous designs from clocked designs has potential benefits of increased modularity and robustness to variations. Several transformations h...
Eliyah Kilada, Kenneth S. Stevens
118
Voted
COMPSAC
2002
IEEE
15 years 9 months ago
Object Identification in Legacy Code as a Grouping Problem
Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems (e.g., due to redundancies, poor modularity and lack of ...
Houari A. Sahraoui, Petko Valtchev, Idrissa Konkob...
VTS
2000
IEEE
103views Hardware» more  VTS 2000»
15 years 9 months ago
Invariance-Based On-Line Test for RTL Controller-Datapath Circuits
We present a low-cost on-line test methodology for RTL controller-datapath pairs, based on the notion of path invariance. The fundamental observation supporting the proposed metho...
Yiorgos Makris, Ismet Bayraktaroglu, Alex Orailogl...
AISC
2010
Springer
15 years 8 months ago
A Formal Quantifier Elimination for Algebraically Closed Fields
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
Cyril Cohen, Assia Mahboubi