We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
— Hybrid Vehicle fuel economy performance is highly sensitive to the energy management strategy used to select among multiple energy sources. Optimal solutions are easy to specif...
Daniel F. Opila, Deepak Aswani, Ryan McGee, Jeffre...
— Web services composition is a very active area of research due to the growing interest of public and private organizations in services integration and/or low cost development o...
Giusy Di Lorenzo, Nicola Mazzocca, Francesco Mosca...