Sciweavers

3221 search results - page 379 / 645
» Termination of Linear Programs
Sort
View
POPL
2008
ACM
16 years 6 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
CP
2005
Springer
16 years 2 days ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
HASKELL
2008
ACM
15 years 7 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
CONCUR
2011
Springer
14 years 6 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
ICCV
2005
IEEE
16 years 8 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas