2356 search results - page 166 / 472 » Characterizations of postman sets |
277
click to vote
ALC
1997
15 years 8 months ago
1997
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
154
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
194
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
139
click to vote
ACS
2008
15 years 6 months ago
2008
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
143
click to vote
AML
2008
15 years 6 months ago
2008
Abstract. We say that a coloring c : []n 2 is continuous if it is continuous with respect to some second countable topology on . A coloring c is potentially continuous if it is co...