Sciweavers

1477 search results - page 92 / 296
» Random Convex Programs
Sort
View
EOR
2010
88views more  EOR 2010»
13 years 9 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
ISIPTA
2005
IEEE
146views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
Jianzhong Zhang 0004, Daniel Berleant
CP
2006
Springer
14 years 16 days ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
UAI
2003
13 years 10 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
ACSAC
2009
IEEE
14 years 3 months ago
Surgically Returning to Randomized lib(c)
—To strengthen systems against code injection attacks, the write or execute only policy (W⊕X) and address space layout randomization (ASLR) are typically used in combination. T...
Giampaolo Fresi Roglia, Lorenzo Martignoni, Robert...