808 search results - page 74 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
136
click to vote
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
133
Voted
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
132
click to vote
AAAI
2007
15 years 7 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
157
click to vote
AUSAI
2007
Springer
15 years 9 months ago
2007
Springer
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
161
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Transmit-power control is a critical task in cognitive radio (CR) networks. In the present contribution, adherence to hierarchies between primary and secondary users in a peer-to-...