971 search results - page 10 / 195 » Approximate Satisfiability and Equivalence |
111
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
112
Voted
FMCAD
2007
Springer
15 years 4 months ago
2007
Springer
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...
RTSS
2002
IEEE
15 years 5 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
129
Voted
ENTCS
2011
14 years 4 months ago
2011
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
94
Voted
COMBINATORICS
2006
15 years 26 days ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...