Sciweavers

30 search results - page 3 / 6
» Disjoint Sum of Product Minimization by Evolutionary Algorit...
Sort
View
CISS
2008
IEEE
14 years 18 days ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
DAC
2003
ACM
14 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
ESWA
2010
105views more  ESWA 2010»
13 years 3 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
CORR
2011
Springer
139views Education» more  CORR 2011»
12 years 10 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 10 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham