784 search results - page 54 / 157 » Relaxing the Value Restriction |
153
Voted
SIAMREV
2010
14 years 8 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
124
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
107
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—The sampling expansion approach for computing the performance of TR UWB systems has restricted validity and is very inaccurate in some cases. A new analytical method to evaluate...
113
click to vote
FORMATS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
CSCLP
2005
Springer
15 years 7 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...