1199 search results - page 140 / 240 » Parameterized Proof Complexity |
IPL
2008
13 years 9 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
WCNC
2008
IEEE
14 years 3 months ago
2008
IEEE
—1 In ISM bands, many wireless protocols proliferate such as 802.11, Bluetooth, and ZigBee. However, these incompatible protocols create complex coexistence and connectivity prob...
CLEF
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...
ISAAC
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...