2509 search results - page 144 / 502 » Abstract Geometrical Computation and Computable Analysis |
164
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
166
click to vote
ERSHOV
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
156
click to vote
DSN
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract-We present a new form of quantitative safety analysis safety optimization. This method is a combination of fault tree analysis(FTA) and mathematical optimization technique...
159
click to vote
SPIN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
169
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...