Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Based on a vision that, in the future, applications will be flexibly built out of small-grained components, we argue that current technologies do not adequately support component d...
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
The purpose of this paper is twofold: (1) to examine the properties of our ANSI C Markup Language (ACML) as a domain-specific language (DSL); and (2) to show that ACML is useful ...