Sciweavers

82 search results - page 5 / 17
» Efficient algorithms for finding critical subgraphs
Sort
View
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 17 days ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
CASES
2004
ACM
13 years 11 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
HIS
2009
13 years 5 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
DEXA
2009
Springer
153views Database» more  DEXA 2009»
13 years 11 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 7 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul