1477 search results - page 12 / 296 » On Graph Problems in a Semi-streaming Model |
91
Voted
COR
2007
14 years 9 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
CP
2006
Springer
15 years 1 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
106
click to vote
GD
2003
Springer
15 years 2 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...