Sciweavers

7991 search results - page 1238 / 1599
» Using More Reasoning to Improve
Sort
View
CONEXT
2006
ACM
16 years 25 days ago
Modeling the AIADD paradigm in networks with variable delays
Modeling TCP is fundamental for understanding Internet behavior. The reason is that TCP is responsible for carrying a huge quota of the Internet traffic. During last decade many a...
Gennaro Boggia, Pietro Camarda, Alessandro D'Alcon...
OOPSLA
2005
Springer
16 years 10 days ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
SAT
2005
Springer
129views Hardware» more  SAT 2005»
16 years 10 days ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
180
Voted
AMAI
2004
Springer
16 years 7 days ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
BIRTHDAY
2004
Springer
16 years 7 days ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
« Prev « First page 1238 / 1599 Last » Next »