Sciweavers

2398 search results - page 114 / 480
» Constraint Programming and Graph Algorithms
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 9 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
OOPSLA
2001
Springer
15 years 9 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
JCP
2008
178views more  JCP 2008»
15 years 4 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik
AI
2004
Springer
15 years 4 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
JGO
2010
115views more  JGO 2010»
15 years 3 months ago
Maximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Gilbert Strang