Sciweavers

3838 search results - page 58 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
15 years 10 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
GECCO
2007
Springer
197views Optimization» more  GECCO 2007»
15 years 3 months ago
Computational intelligence techniques: a study of scleroderma skin disease
This paper presents an analysis of microarray gene expression data from patients with and without scleroderma skin disease using computational intelligence and visual data mining ...
Julio J. Valdés, Alan J. Barton
AWIC
2003
Springer
15 years 3 months ago
Secure Intelligent Agents Based on Formal Description Techniques
This paper describes a practical solution for the incorporation of security services in agents. From a set of basic user requirements, the agents will be able to find out the best ...
L. Mengual, C. de la Puente
LCPC
1998
Springer
15 years 2 months ago
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a...
Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhar...
AMAI
2000
Springer
15 years 1 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva