Sciweavers

108 search results - page 5 / 22
» User-Definable Resource Bounds Analysis for Logic Programs
Sort
View
CPAIOR
2010
Springer
13 years 11 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
IPPS
1999
IEEE
13 years 11 months ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
ICLP
1997
Springer
13 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CPAIOR
2007
Springer
14 years 26 days ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 7 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi