1143 search results - page 185 / 229 » pairing 2007 |
ENTCS
2007
13 years 7 months ago
2007
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
ENTCS
2007
13 years 7 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
EOR
2007
13 years 7 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
EOR
2007
13 years 7 months ago
2007
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
FUIN
2007
13 years 7 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...