105
click to vote
MST
2016
10 years 25 days ago
2016
An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...
103
click to vote
MST
2016
10 years 25 days ago
2016
Abstract Some measures of randomness have been introduced for MartinL¨of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-rand...
224
click to vote
MSCS
2016
10 years 25 days ago
2016
The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for mul...
228
click to vote
MR
2016
10 years 25 days ago
2016
— Stochastic computing utilizes compact arithmetic circuits that can potentially lower the implementation cost in silicon area. In addition, stochastic computing provides inheren...
131
click to vote
MPC
2016
Springer
10 years 25 days ago
2016
Springer
We discuss the variability in the performance of multiple runs of branch-and-cut Mixed Integer Linear Programming solvers, and we concentrate on the one deriving from the use of di...
219
click to vote
MPC
2016
Springer
10 years 25 days ago
2016
Springer
The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted mast...
120
click to vote
MP
2016
10 years 25 days ago
2016
We study the convex hull of the continuous knapsack set which consists of a single inequality constraint with n non-negative integer and m non-negative bounded continuous variable...