Sciweavers

AUTOMATICA
2010
111views more  AUTOMATICA 2010»
13 years 9 months ago
Connection between cooperative positive systems and integral input-to-state stability of large-scale systems
We consider a class of continuous-time cooperative systems evolving on the positive orthant Rn +. We show that if the origin is globally attractive, then it is also globally stabl...
Björn Rüffer, Christopher M. Kellett, St...
AUSAI
2010
Springer
13 years 9 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
AUSAI
2010
Springer
13 years 9 months ago
Evolutionary Non Photo-Realistic Animations with Triangular Brushstrokes
Abstract. We have developed a method for generating non photorealistic animations of a target image. The animations start as a random collection of triangular strokes on a canvas a...
Ashkan Izadi, Victor Ciesielski, Marsha Berry
APPML
2010
93views more  APPML 2010»
13 years 9 months ago
On the univalence of an integral operator
Virgil Pescar
AOR
2010
13 years 9 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
AOR
2010
13 years 9 months ago
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
Javier Peña, Xavier Saynac, Juan Carlos Ver...
AOR
2010
13 years 9 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
AOR
2010
13 years 9 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi