2957 search results - page 285 / 592 » The Complexity of Polynomial-Time Approximation |
172
Voted
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
198
Voted
COCO
1994
Springer
15 years 10 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
161
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
170
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
189
click to vote
TPDS
2008
15 years 6 months ago
2008
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...