Sciweavers

19320 search results - page 3802 / 3864
» On the complexity of computing determinants
Sort
View
CPAIOR
2008
Springer
14 years 11 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
14 years 11 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
DNA
2008
Springer
14 years 11 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
14 years 11 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...
FASE
2008
Springer
14 years 11 months ago
Automated Analysis of Permission-Based Security Using UMLsec
Abstract. To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems' resources. These permissions enf...
Jan Jürjens, Jörg Schreck, Yijun Yu
« Prev « First page 3802 / 3864 Last » Next »