Titlebook: SOFSEM 2011: Theory and Practice of Computer Science; 37th Conference on C Ivana Černá,Tibor Gyimóthy,Stefan Wolf Conference proceedings 20

小口啜饮

expository

Libido

Nadja Betzler,Robert Bredereck,Rolf Niedermeier,Johannes Uhlmanns position is more complex than it is usually considered. If it comprises eliminativism, it is not a bald eliminativism. For in the first part of the fragment, he says “By convention colour exists, by convention sweet exists, …” I suggest that there is a way of understanding Democritus’s position: i

Cpr951

现代

音乐戏剧

aphasia

GreedyMAX-type Algorithms for the Maximum Independent Set Problem,1/(. + 1) for the performance ratio of .-type algorithms which favorably compares with the bound 1/(Δ + 1) known to hold for .. The cardinality of an independent set generated by any .-type algorithm is at least ., which strengthens the bounds of Turán and Caro-Wei stated in terms of vertex degrees.

Lime石灰

CREEK

Fillet,Filet

Verification of Timed-Arc Petri Nets,ies of automatic verification and the connections between TAPN and the model of timed automata. Finally, we will mention the tool TAPAAL that supports modelling, simulation and verification of TAPN and discuss a small case study of alternating bit protocol.