1679 search results - page 1 / 336 » Strong order equivalence |
AMAI
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
COMBINATORICS
2006
13 years 4 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
MOR
2006
13 years 4 months ago
2006
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
DAM
2008
13 years 4 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...