Sciweavers

1411 search results - page 165 / 283
» A Value Analysis for C Programs
Sort
View
CP
2005
Springer
15 years 10 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 4 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
88
Voted
SIGARCH
2002
57views more  SIGARCH 2002»
15 years 4 months ago
An improved index function for (D)FCM predictors
The most promising value predictors to date are the finite context method predictor and a recent improvement thereof, the differential finite context method predictor. Both predic...
Martin Burtscher
MSCS
2010
84views more  MSCS 2010»
15 years 3 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi
261
Voted
POPL
2005
ACM
16 years 5 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko