Sciweavers

2976 search results - page 171 / 596
» On the bounded integer programming
Sort
View
CP
2007
Springer
16 years 18 days ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 1 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
SEFM
2008
IEEE
16 years 24 days ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 7 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
COCOON
2008
Springer
15 years 8 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu