15073 search results - page 392 / 3015 » Probabilistic algorithms for computing resultants |
198
click to vote
AB
2008
Springer
16 years 19 days ago
2008
Springer
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...
149
click to vote
IPPS
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
141
click to vote
EOR
2008
15 years 6 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
214
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
189
Voted
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...