Sciweavers

13603 search results - page 422 / 2721
» On the Complexity of Computing Treelength
Sort
View
FMCO
2005
Springer
101views Formal Methods» more  FMCO 2005»
16 years 1 months ago
Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo M...
GECCO
2005
Springer
148views Optimization» more  GECCO 2005»
16 years 1 months ago
An analysis of island models in evolutionary computation
A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island mo...
Zbigniew Skolicki
GRID
2005
Springer
16 years 1 months ago
Application centric autonomic BW control in utility computing
— QoS and congestion performance are crucial to good application performance in a utility computing environment. Unfortunately, proper IP QoS setup is very complex and is either ...
Krishna Kant
HPCC
2005
Springer
16 years 1 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
16 years 1 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang