Sciweavers

7189 search results - page 61 / 1438
» Connecting Design with Code
Sort
View
STACS
2009
Springer
14 years 5 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
IV
2007
IEEE
160views Visualization» more  IV 2007»
14 years 4 months ago
Narratological Constructs in the Gestalt of the 3D Game environment: Aboriginal Knowledge and its Connection to the Data Landsca
This paper reports on a project federally funded by the Australian CRC for Interaction Design (ACID). It investigates the use of a 3D game engine as a landscape metaphor for hosti...
Theodor G. Wyeld, Malcolm Pumpa
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
14 years 4 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov
ARCS
2004
Springer
14 years 3 months ago
VIA2SISCI - A New Library that Provides the VIA Semantics for SCI Connected Clusters
: Normally the SISCI interface provides a Distributed Shared Memory (DSM) abstraction using the Scalable Coherent Interface (SCI). This paper describes and discusses the design and...
Torsten Mehlan, Wolfgang Rehm
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
14 years 3 months ago
Highly compliant and self-tightening docking modules for precise and fast connection of self-reconfigurable robots
― This paper describes a new docking system called Compliant-And-Self-Tightening (CAST) developed as an effective and efficient connector for joining and releasing modules of sel...
Behrokh Khoshnevis, Peter M. Will, Wei-Min Shen