303 search results - page 30 / 61 » Discrete Mathematics for Computer Science, Some Notes |
COMPLEX
2009
Springer
13 years 11 months ago
2009
Springer
We consider collisions of moving breathers (MBs) in the Peyrard-Bishop DNA model. Two identical stationary breathers, separated by a fixed number of pair-bases, are perturbed and b...
IJHPCA
2010
13 years 8 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
GD
2005
Springer
14 years 3 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
JCP
2008
13 years 9 months ago
2008
Abstract--In this paper, we report some results on hardware and software co-design of an adaptive linear neuron (ADALINE) based control system. A discrete-time Proportional-Integra...
DMGT
2011
13 years 1 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...