Sciweavers

270 search results - page 7 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
EOR
2008
93views more  EOR 2008»
13 years 7 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Exact aggregate solutions for M/G/1-type Markov processes
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
Alma Riska, Evgenia Smirni
CVPR
2012
IEEE
11 years 10 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
PRDC
2006
IEEE
14 years 1 months ago
Detecting and Exploiting Symmetry in Discrete-state Markov Models
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
W. Douglas Obal II, Michael G. McQuinn, William H....
EUROGP
2004
Springer
160views Optimization» more  EUROGP 2004»
13 years 11 months ago
Exploiting Reflection in Object Oriented Genetic Programming
Most programs currently written by humans are object-oriented ones. Two of the greatest benefits of object oriented programming are the separation of interface from implementation,...
Simon M. Lucas