2356 search results - page 58 / 472 » Characterizations of postman sets |
100
Voted
DAC
1992
ACM
15 years 4 months ago
1992
ACM
Designing instruction set processors and constructing their compilers are mutually dependent tasks. Piper is a high level synthesis tool of ADAS which controls the hardware-softwa...
CCIA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
SIAMJO
2008
14 years 11 months ago
2008
Using variational analysis, we study the linear regularity for a collection of finitely many closed sets. In particular, we extend duality characterizations of the linear regularit...
101
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...