Sciweavers

1201 search results - page 135 / 241
» Exact Analysis of Exact Change
Sort
View
CEC
2008
IEEE
13 years 10 months ago
Regulation of gene regulation - smooth binding with dynamic affinity affects evolvability
Abstract-- Understanding the evolvability of simple differentiating multicellular systems is a fundamental problem in the biology of genetic regulatory networks and in computationa...
Johannes F. Knabe, Chrystopher L. Nehaniv, Maria J...
SUM
2010
Springer
13 years 8 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
OOPSLA
2010
Springer
13 years 8 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel
CSFW
2012
IEEE
12 years 22 days ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking