Titlebook: Experimental and Efficient Algorithms; Second International Klaus Jansen,Marian Margraf,José D. P. Rolim Conference proceedings 2003 Spring

联想记忆

Algorithms and Experiments on Colouring Squares of Planar Graphs, .. We have also implemented and experimentally evaluated the performance of most of the known approximation colouring algorithms for SQPG [., ., ., .]. We compare the quality of the colourings achieved by these algorithms, with the colourings obtained by our algorithms and with the results obtained

Nutrient

homocysteine

安慰

蜡烛

Search Data Structures for Skewed Strings,ed (random) strings. For instance, this is the case of URL addresses, IP addresses, or XML path strings, all representing paths in some hierarchical order. As strings sharing a portion of the path have a quite long common prefix, we need to avoid the time-consuming repeated examination of these comm

badinage

Evaluation of Basic Protocols for Optical Smart Dust Networks,. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in [.] for relatively small random networks (1000 to 15000 sensors).

慢跑

narcotic

intimate

ABASH

Comparing Push- and Pull-Based Broadcasting, algorithms. It comprises many helpful data-structures, a graphical interface with several components and a library with implementations of selected scheduling algorithms. Every scheduling problem covered by the classification-scheme originally proposed by Graham et al. [.] can easily be integrated