1291 search results - page 128 / 259 » Computing the multiplicity structure in solving polynomial s... |
126
Voted
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
206
click to vote
PE
2011
Springer
14 years 8 months ago
2011
Springer
In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subs...
130
click to vote
DSN
2004
IEEE
15 years 5 months ago
2004
IEEE
Voice over IP (VoIP) systems are gaining in popularity as the technology for transmitting voice traffic over IP networks. As the popularity of VoIP systems increases, they are bei...
102
click to vote
DAC
2008
ACM
16 years 2 months ago
2008
ACM
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
LREC
2010
15 years 3 months ago
2010
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...