Sciweavers

6409 search results - page 377 / 1282
» A Computational Algorithm for Origami Design
Sort
View
ICIC
2009
Springer
16 years 1 months ago
A Method for Multiple Sequence Alignment Based on Particle Swarm Optimization
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an impro...
Fasheng Xu, Yuehui Chen
IPPS
1999
IEEE
15 years 11 months ago
Experimental Evaluation of QSM, a Simple Shared-Memory Model
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
Brian Grayson, Michael Dahlin, Vijaya Ramachandran
GLVLSI
2007
IEEE
153views VLSI» more  GLVLSI 2007»
15 years 8 months ago
Address generation for nanowire decoders
Nanoscale crossbars built from nanowires can form high density memories and programmable logic devices. To integrate such nanoscale devices with other circuits, nanowire decoders ...
Jia Wang, Ming-Yang Kao, Hai Zhou
IANDC
2008
80views more  IANDC 2008»
15 years 6 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
DAC
2003
ACM
16 years 7 months ago
Large-scale SOP minimization using decomposition and functional properties
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
Alan Mishchenko, Tsutomu Sasao