3049 search results - page 309 / 610 » On the Convergence of Bound Optimization Algorithms |
179
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
148
click to vote
ICCSA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
181
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
203
click to vote
TSP
2011
15 years 1 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
157
click to vote
AE
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...