1483 search results - page 106 / 297 » Geometric constraint satisfaction using optimization methods |
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
We analyze spread-spectrum and quantization projection data hiding methods from a game-theoretic point of view, using the bit error rate (BER) as the payoff, and assuming that the...
117
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
133
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
103
click to vote
ECRTS
2004
IEEE
15 years 5 months ago
2004
IEEE
In [1], Jejurikar and Gupta investigated energy savings due to optimal slowdown of periodic tasks in real-time task systems, where tasks have varying power characteristics and task...
113
click to vote
ISNN
2005
Springer
15 years 7 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...