1711 search results - page 36 / 343 » Completing pseudojump operators |
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
AVBPA
2003
Springer
14 years 1 months ago
2003
Springer
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
IFM
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
CALCO
2011
Springer
12 years 7 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
CLUSTER
2007
IEEE
13 years 11 months ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...