Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Meeting memory features are poorly integrated into current group support systems (GSS). This paper discusses how to introduce meeting memory functionality into a GSS. The paper fi...
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
Nonsmoothness pervades optimization, but the way it typically arises is highly structured. Nonsmooth behavior of an objective function is usually associated, locally, with an activ...