383 search results - page 47 / 77 » A new infeasible interior-point algorithm for linear program... |
147
Voted
ORL
2006
15 years 3 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
130
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
124
click to vote
SAS
1997
Springer
15 years 7 months ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
106
Voted
WEBI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
108
Voted
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...