441 search results - page 27 / 89 » Refinement of Time |
CSR
2008
Springer
13 years 10 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
AIS
2000
Springer
13 years 8 months ago
2000
Springer
Interface design normally follows the traditional approach of Art and Design, which requires reworking to refine an idea through visual playfulness until a solution has been achiev...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm desi...
ENTCS
2002
13 years 8 months ago
2002
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...