Sciweavers

990 search results - page 135 / 198
» Sub-Graphs of Complete Graph
Sort
View
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
13 years 12 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
AGTIVE
2007
Springer
13 years 11 months ago
Domain Specific Languages with Graphical and Textual Views
We show our approach for the definition of Domain Specific Languages integrating both graphical and textual views. The approach is based on the meta-modelling concepts provided by ...
Francisco Pérez Andrés, Juan de Lara...
IPPS
2000
IEEE
13 years 11 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
DAGSTUHL
2000
13 years 9 months ago
Vision and Touch for Grasping
This paper introduces our one-armed stationary humanoid robot GripSee together with research projects carried out on this platform. The major goal is to have it analyze a table sce...
Rolf P. Würtz
SIROCCO
2000
13 years 9 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...