519 search results - page 33 / 104 » A New Approach to Strongly Polynomial Linear Programming |
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
129
click to vote
ITSSA
2006
15 years 1 months ago
2006
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
108
click to vote
ASPDAC
1999
ACM
15 years 5 months ago
1999
ACM
Certain manufacturing steps in very deep submicron VLSI involve chemical-mechanical polishing CMP which has varying e ects on device and interconnect features, depending on loca...
146
click to vote
CCE
2008
15 years 1 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
106
click to vote
TASE
2008
IEEE
15 years 1 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...