311 search results - page 11 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
IJON
2002
13 years 8 months ago
2002
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...
FOIKS
2008
Springer
13 years 10 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
MP
2002
13 years 8 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
TSP
2008
13 years 8 months ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
AI
2003
Springer
14 years 1 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...