743 search results - page 104 / 149 » Optimal Abstraction on Real-Valued Programs |
EDOC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—A simple and effective composition of software services into higher-level composite services is still a very challenging task. Especially in enterprise environments, Qua...
IEEEPACT
2002
IEEE
15 years 2 months ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...
ECOOP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. A generational collection strategy utilizing a single nursery cannot efficiently manage objects in application servers due to variance in their lifespans. In this paper, ...
JCO
1998
14 years 9 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
IOR
2007
14 years 9 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...