Sciweavers

725 search results - page 88 / 145
» heuristics 2010
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CAV
2010
Springer
225views Hardware» more  CAV 2010»
14 years 1 months ago
Merit: An Interpolating Model-Checker
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
Nicolas Caniart
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 12 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
BIRTHDAY
2010
Springer
13 years 11 months ago
Inferring Loop Invariants Using Postconditions
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
Carlo A. Furia, Bertrand Meyer
RECSYS
2010
ACM
13 years 10 months ago
Workshop on user-centric evaluation of recommender systems and their interfaces
In this paper, we aim to analyse the current level of usability on ten popular online websites utilising some kind of reputation system. The conducted heuristic and expert evaluat...
Bart P. Knijnenburg, Lars Schmidt-Thieme, Dirk G. ...