Sciweavers

501 search results - page 55 / 101
» Methods for true power minimization
Sort
View
TVLSI
1998
124views more  TVLSI 1998»
13 years 7 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
13 years 6 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 11 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
ACSAC
2005
IEEE
14 years 1 months ago
Lessons Learned: A Security Analysis of the Internet Chess Club
The Internet Chess Club (ICC) is a popular online chess server with more than 30,000 members worldwide including various celebrities and the best chess players in the world. Altho...
John Black, Martin Cochran, Martin Ryan Gardner