Sciweavers

292 search results - page 25 / 59
» Are Stable Instances Easy
Sort
View
POPL
2001
ACM
16 years 1 months ago
A generic type system for the Pi-calculus
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
Atsushi Igarashi, Naoki Kobayashi
78
Voted
IWSOS
2009
Springer
15 years 7 months ago
Resolving the Noxious Effect of Churn on Internet Coordinate Systems
Internet Coordinate Systems (ICS) provide easy and practical latency predictions in the Internet. However, peer dynamics (i.e, churn), which is an inherent property of peer-to-peer...
Bamba Gueye, Guy Leduc
99
Voted
PPDP
2009
Springer
15 years 7 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
SAT
2009
Springer
111views Hardware» more  SAT 2009»
15 years 7 months ago
Restart Strategy Selection Using Machine Learning Techniques
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
Shai Haim, Toby Walsh
DELTA
2008
IEEE
15 years 7 months ago
An Integrated Validation Environment for Differential Power Analysis
Integrated systems represent the most common solution for storage and transmission of confidential data. However, cryptographic devices can be subject to passive attacks that cons...
Giorgio Di Natale, Marie-Lise Flottes, Bruno Rouze...