2356 search results - page 91 / 472 » Characterizations of postman sets |
162
click to vote
HPDC
2012
IEEE
13 years 6 months ago
2012
IEEE
This paper presents a scheme to optimize the mapping of HPC applications to a set of hybrid dedicated and cloud resources. First, we characterize application performance on dedica...
130
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
134
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
116
click to vote
AML
2008
15 years 4 months ago
2008
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
145
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...