Sciweavers

1503 search results - page 183 / 301
» Self-optimizing distributed trees
Sort
View
CDVE
2006
Springer
130views Visualization» more  CDVE 2006»
15 years 7 months ago
Flexible Collaboration over XML Documents
Abstract. XML documents are increasingly being used to mark up various kinds of data from web content to scientific data. Often these documents need to be collaboratively created a...
Claudia-Lavinia Ignat, Moira C. Norrie
JPDC
2006
134views more  JPDC 2006»
15 years 3 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
IJISTA
2007
88views more  IJISTA 2007»
15 years 3 months ago
Event triggered Holonic organisation formation
: Internet based distributed collaborative commerce must resolve two problems first. One is what organisation shape is and the other is how to establish an efficient and active org...
Mingwei Yuan, Ping Jiang, Zuren Feng
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
15 years 3 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
128
Voted
EOR
2002
84views more  EOR 2002»
15 years 3 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley