Sciweavers

16666 search results - page 3265 / 3334
» Descriptive and Computational Complexity
Sort
View
CPAIOR
2008
Springer
15 years 5 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
CSCLP
2008
Springer
15 years 5 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
15 years 5 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
DNA
2008
Springer
15 years 5 months ago
A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits
The prospects of programming molecular systems to perform complex autonomous tasks has motivated research into the design of synthetic biochemical circuits. Of particular interest ...
Lulu Qian, Erik Winfree
ESORICS
2008
Springer
15 years 5 months ago
Symmetric Key Approaches to Securing BGP - A Little Bit Trust Is Enough
The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol that connects autonomous systems (ASes). Despite its importance for the Internet infrastructure, BGP...
Bezawada Bruhadeshwar, Sandeep S. Kulkarni, Alex X...
« Prev « First page 3265 / 3334 Last » Next »