Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...