2974 search results - page 302 / 595 » Model-Driven Constraint Programming |
165
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
164
click to vote
TASLP
2010
15 years 1 months ago
2010
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
185
click to vote
JFP
2000
15 years 6 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
157
click to vote
CPAIOR
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
163
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...