Search Results

AI, analytics, and database performance depend on a small number of “hot” functions. After linear algebra, elementary and special functions follow in impact. They include the most basic arithmetic operations (e.g., divide), and specialized functions (...

An important part of recent advances in hexahedral meshing focuses on the deformation of a domain into a polycube; the polycube deformed by the inverse map fills the domain with a hexahedral mesh. These methods are appreciated because ...

Display Omitted

• Provides a new approach to robustly extract hexahedral meshes from Polycube-maps.

Error-Tolerant applications regularly accomplish more data adaption. Approximate computing is one of the optimum strategies for data manipulation in several Error-Tolerant applications. It depletes circuit complexity and enhances area, power, and ...

As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investigate the scheduling of parallel two-stage flowshops under makespan constraint, which was motivated by applications in cloud computing ...

In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. In this setting, jobs are required to be executed non-preemptively and in unison, in the ...$\frac{}{\mathrm{}}$$$$\frac{\mathrm{}}{\mathrm{}}$$\mathrm{}$$$${}_{}$

In a digraph with a source and several destination nodes with associated demands, an unsplittable flow routes each demand along a single path from the common source to its destination. Given some flow x that is not necessarily unsplittable but ...${}_{}{}_{}$${}_{}{}_{}{}_{}$${}_{}$${}_{}{}_{}{}_{}$${}_{}\mathrm{}{}_{}{}_{}\mathrm{}{}_{}{}_{}$

Network Function Virtualization (NFV) is an emerging approach to serve diverse demands of network services by decoupling network functions and dedicated network devices. Traffic needs to traverse through a sequence of software-based ...

The knapsack problem arises in several real-world applications, like manufacturing systems, transportation, cutting and packing, and hydrological studies. In this paper, we investigate the use of an iterative rounding strategy-based algorithm for ...

In this paper, we address the routing and recharging problem for electric vehicles, where charging nodes have heterogeneous prices and waiting times, and the objective is to minimize the total recharging cost. We prove that the problem is NP-hard ...$\mathrm{}$

Software Defined Networks (SDN) enables the network control logic to be designed and operated on a global network view by decoupling the control plane from the data plane. Due to versatility and universality of network applications, ...

We study a new technique to check the existence of feasible points for mixed-integer nonlinear optimization problems that satisfy a structural requirement called granularity. For granular optimization problems, we show how rounding the optimal ...

Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be ...

We introduce granularity as a sufficient condition for the consistency of a mixed-integer optimization problem, and show how to exploit it for the computation of feasible points: For optimization problems which are granular, solving certain linear ...

We study a precedence-constrained identical parallel machine scheduling problem with rejection. There is a communication delay between any two jobs connected in the precedence network where jobs may be rejected with penalty. The goal is to minimize the ...

A powerful algorithmic technique for truthful mechanism design is the maximal-in-distributional-range (MIDR) paradigm. Unfortunately, many such algorithms use heavy algorithmic machinery, e.g., the ellipsoid method and (approximate) solution of convex ...

To identify the routine information needs of inpatient clinicians on the general wards for the development of an electronic dashboard. Survey of internal medicine and subspecialty clinicians from March 2014---July 2014 at Saint Marys Hospital in ...

The result of a floating-point operation is usually defined to be the floating-point number nearest to the exact real result together with a tie-breaking rule. This is called the first standard model of floating-point arithmetic, and the analysis ...

We introduce computable a priori and a posteriori error bounds for optimality and feasibility of a point generated as the rounding of an optimal point of the LP relaxation of a mixed integer linear optimization problem. Treating the mesh size of integer ...

Floating-point machine precision is often not sufficient to correctly solve large scientific and engineering problems. Moreover, computation time is a critical parameter here. Therefore, any research aimed at developing high-speed methods for multiple-...

We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each machine can be feasibly scheduled. Despite its importance for modern real-time systems, this problem has not been studied before. We present a polynomial-...