306 search results - page 44 / 62 » Underspecified computation of normal forms |
RTA
2004
Springer
14 years 27 days ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
STACS
2004
Springer
14 years 27 days ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
CVPR
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we propose how the parameter distributions of multilinear geometric entities can be dualised. The dualisation concern, for example, the parameter distributions of c...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...