Sciweavers

2771 search results - page 150 / 555
» A General Computational Treatment of the Comparative
Sort
View
MFCS
1997
Springer
15 years 10 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning
IPPS
1993
IEEE
15 years 10 months ago
New Wormhole Routing Algorithms for Multicomputers
Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we pro...
Rajendra V. Boppana, Suresh Chalasani
CONEXT
2007
ACM
15 years 10 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
DPPI
2007
ACM
15 years 10 months ago
TILTle: exploring dynamic balance
In this paper we introduce a novel interface for exploring dynamic equilibria using the metaphor of a traditional balance scale. Rather than comparing and identifying physical weig...
Paulina Modlitba, Dietmar Offenhuber, Moses Ting, ...
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
15 years 10 months ago
Hardware acceleration of multi-deme genetic algorithm for the application of DNA codeword searching
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
Qinru Qiu, Daniel J. Burns, Prakash Mukre, Qing Wu