Sciweavers

11740 search results - page 126 / 2348
» More Problems in Rewriting
Sort
View
96
Voted
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
15 years 4 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
107
Voted
ICA
2007
Springer
15 years 4 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
94
Voted
CP
2009
Springer
15 years 7 months ago
A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
Helmut Simonis
120
Voted
CSCLP
2007
Springer
15 years 7 months ago
Preference-Based Problem Solving for Constraint Programming
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Ulrich Junker
126
Voted
CSCLP
2005
Springer
15 years 6 months ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták