Sciweavers

441 search results - page 19 / 89
» A Method for Proving Observational Equivalence
Sort
View
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
MFCS
1991
Springer
14 years 10 days ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
SIAMJO
2008
141views more  SIAMJO 2008»
13 years 8 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
POPL
2009
ACM
14 years 9 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg
ICCAD
2005
IEEE
96views Hardware» more  ICCAD 2005»
14 years 5 months ago
A more reliable reduction algorithm for behavioral model extraction
— In this paper we are concerned with developing more reliable model reduction algorithms. We have focused on less common, but real, examples that fail to be effectively reduced ...
Dmitry Vasilyev, Jacob K. White