Sciweavers

2976 search results - page 101 / 596
» On the bounded integer programming
Sort
View
108
Voted
ICLP
1999
Springer
15 years 4 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
100
Voted
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
15 years 7 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 4 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
SIAMJO
2010
107views more  SIAMJO 2010»
14 years 7 months ago
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
Etienne de Klerk, Monique Laurent
PLDI
2009
ACM
15 years 5 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...