361 search results - page 13 / 73 » Relaxed Gabriel Graphs |
ISPD
2000
ACM
13 years 12 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
ENDM
2008
13 years 7 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
ICRA
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we quantify several spatial capabilities of the hmnan tactile system needed for tactile feedback, or teletaction. Psychophysics experiments measure the amplitude re...
TROB
2008
13 years 7 months ago
2008
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...