Sciweavers

77 search results - page 10 / 16
» Computer-aided molecular design using Tabu search
Sort
View
COCOON
1998
Springer
14 years 19 days ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
DSD
2005
IEEE
116views Hardware» more  DSD 2005»
14 years 2 months ago
Optimization of a Bus-based Test Data Transportation Mechanism in System-on-Chip
The increasing amount of test data needed to test SOC (System-on-Chip) entails efficient design of the TAM (test access mechanism), which is used to transport test data inside the...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
CGA
2007
13 years 8 months ago
Content-Based 3D Object Retrieval
3D objects are an important multimedia data type with many applications in domains such as Computer Aided Design, Simulation, Visualization, and Entertainment. Advancements in pro...
Benjamin Bustos, Daniel A. Keim, Dietmar Saupe, To...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 3 days ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...