1679 search results - page 9 / 336 » Strong order equivalence |
ASPDAC
2007
ACM
14 years 17 days ago
2007
ACM
ENTCS
2002
13 years 8 months ago
2002
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...
ICLP
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
SIAMJO
2008
13 years 8 months ago
2008
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 ...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...