3864 search results - page 231 / 773 » time 2005 |
185
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
185
click to vote
EMSOFT
2005
Springer
16 years 1 days ago
2005
Springer
UPPAAL-TRON is a new tool for model based online black-box conformance testing of real-time embedded systems specified as timed automata. In this paper we present our experiences...
159
click to vote
FSKD
2005
Springer
16 years 1 days ago
2005
Springer
Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing...
163
click to vote
GD
2005
Springer
16 years 1 days ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
163
click to vote
ICCNMC
2005
Springer
16 years 1 days ago
2005
Springer
This paper proposes RTT-thumbprint to traceback intruders, and to detect stepping-stone intrusion; RTT-thumbprint is a sequence of timestamp pairs of a send packet and its correspo...