336 Hits in 8.3 sec

Coordinated Robot Navigation via Hierarchical Clustering

Omur Arslan, Dan P. Guralnik, Daniel E. Koditschek
2016 IEEE Transactions on robotics  
Given a desired configuration supporting a desired hierarchy, we construct a hybrid controller which is quadratic in n and algebraic in d and prove that its execution brings all but a measure zero set  ...  We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots.  ...  A preliminary version of this paper is presented in the conference paper [1] for point particles and a certain choice of hierarchical clustering.  ... 
doi:10.1109/tro.2016.2524018 fatcat:vfcsclh54jh2jjl63njzdywaxm

A Design Flow for Performance Planning: New Paradigms for Iteration Free Synthesis [chapter]

Ralph H. J. M. Otten
2000 Architecture Design and Validation Methods  
To achieve a non-iterative design flow, early synthesis stages should use wire planning to distribute delays over the functional elements and interconnect, and layout synthesis should use its degrees of  ...  Timing anal ysis is built into a feedback loop to detect timing violations which are then used to update specifications to synthesis.  ...  Acknowledgment: Part of this chapter has been presented by the present author and Robert Brayton at the Design Automation Conference 1998 for an audience of over 800 people.  ... 
doi:10.1007/978-3-642-57199-2_3 fatcat:mgkqytwgira3ve2fomfdh22ici

MGV: a system for visualizing massive multidigraphs

J. Abello, J. Korn
2002 IEEE Transactions on Visualization and Computer Graphics  
This makes the association of geographic information and graph data very natural. To automate the creation of the vertex set hierarchy for MGV, we use the notion of graph sketches.  ...  MGV builds an out-of-core graph hierarchy and provides mechanisms to plug in arbitrary visual representations for each graph hierarchy slice.  ...  Sudarsky and W. Sweldens for comments and discussions about this work.  ... 
doi:10.1109/2945.981849 fatcat:n2455jastrfknhbhl4jie6egke

Multilayer Control Hierarchy for Water Management Decisions in Integrated Hydrologic Simulation Model

Joseph Park, Jayantha Obeysekera, Randy VanZee
2007 Journal of water resources planning and management  
The model is designed to allow a flexible, extensible expression of a wide variety of natural hydrologic processes, as well as anthropogenic water resource control schemes in order to facilitate alternative  ...  The MSE is based on a multilayer hierarchical control architecture, which naturally encompasses the local control of hydraulic structures, as well as the coordinated subregional and regional control of  ...  This is not to say that the synthesis of control system and decision making software has failed to be successful in many of these models, rather, that careful design and decomposition of the hydraulic  ... 
doi:10.1061/(asce)0733-9496(2007)133:2(117) fatcat:zjlpvuy7gbfkxcx3ckildrtnye

Machine interpretation of CAD data for manufacturing applications

Qiang Ji, Michael M. Marefat
1997 ACM Computing Surveys  
It can be used in CAD/CAM for evaluation of designs, in computer vision for machine recognition and machine inspection of objects, and in intelligent manufacturing for automating and integrating the link  ...  between design and manufacturing.  ...  An ideal representation would be a hybrid representation scheme that would inherit the advantages of both B-Rep and CSG.  ... 
doi:10.1145/262009.262012 fatcat:zeyxraytzvf4rdkqokteb4fope

Research on domain ontology in different granulations based on concept lattice

Xiangping Kang, Deyu Li, Suge Wang
2012 Knowledge-Based Systems  
Moreover, the similarly of concepts in different granulations is introduced to help domain experts judging relations except for inheritance relation, and the similarity of ontologies in multi-granulations  ...  This paper introduces concept lattice and granular computing into ontology learning, and presents a unified research model for ontology building, ontology merging and ontology connection based on the domain  ...  Acknowledgements The work is supported by the National Natural Science Foundation of China (60970014, 61070100 and 60875040), the Natural Science Foundation of Shanxi, China (2010011021-1) and the Graduate  ... 
doi:10.1016/j.knosys.2011.09.016 fatcat:6yiqwbhjvnfrnnxetok5tmo7y4

The Use of Precomputed Triangle Clusters for Accelerated Ray Tracing in Dynamic Scenes

Kirill Garanzha
2009 Computer graphics forum (Print)  
In this paper we present a hybrid algorithm for building the bounding volume hierarchy (BVH) that is used in accelerating ray tracing of animated models.  ...  This heuristic combines the density of connectivity, geometric size and the shape of the cluster.  ...  Acknowledgements The author thanks Erica Darkina and anonymous reviewers for providing feedback on the paper.  ... 
doi:10.1111/j.1467-8659.2009.01497.x fatcat:j77dyw6wa5g5no3vqpccmxwnuy

Model-Free Optimal Control of Linear Multi-Agent Systems via Decomposition and Hierarchical Approximation [article]

Gangshan Jing, He Bai, Jemin George, Aranya Chakrabortty
2021 arXiv   pre-print
We consider the objective function to be specified over an undirected graph, and cast the decomposition as a graph clustering problem.  ...  The first component optimizes the performance of each independent cluster by solving the smaller-size LQR design problem in a model-free way using an RL algorithm.  ...  If we consider l ij as a binary variable, then the maximum value of l ij is 1 if i j, and is 0 otherwise.  ... 
arXiv:2008.06604v2 fatcat:ymzoo4elwzdmzi5srb2isnxeba

Darwinian embodied evolution of the learning ability for survival

Stefan Elfwing, Eiji Uchibe, Kenji Doya, Henrik I Christensen
2011 Adaptive Behavior  
The decomposition gives a tree graph representation, called MAXQ graph, of the problem.  ...  The considered applications in this thesis are: 1) decomposition of an overall task into suitable subtasks and, thereby, constructing a task hierarchy that is adapted to both the task and the environment  ... 
doi:10.1177/1059712310397633 fatcat:2r5mx4nh3rdvliamrqo5ve6ttq


1992 International Journal of High Speed Electronics and Systems  
This approach provides means for specifying and techniques for satisfying a wide range of constraints (physical, topological, timing) and is, therefore, able to generate oorplans for a number of di erent  ...  A systematic and e cient optimization procedure during the selection of suitable oorplan patterns that integrates oorplanning, global routing and pin assignment, a new pin assignment technique based on  ...  Floorplanning tools can be used in the feedback loop of a high-level synthesis system to improve s c heduling and allocation. First, a schedule and register-transfer data path are constructed.  ... 
doi:10.1142/s0129156492000060 fatcat:rpjhsqwenbdalonkrmyfgjpujm

Subject index volumes 1–200

1999 Theoretical Computer Science  
colouring of triangulated graphs, 1842 differences, 1382 directed hypergraphs, 3326 errors, 1382 exact threshold gate, 3014 feedback vertex set problem on permutation graphs, 1045 graph, 402,  ...  storage medium, 773 subroutine-call graphs, 1156 subsegment, 2287 order, 2287 subsemigroup. 630 subsemigroups of free semigroups, 3512 subsequence embedding relation, 55 1 graph of a text, 1466  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Comparison for Image Edge Detection Algorithms

Li Bin
2012 IOSR Journal of Computer Engineering  
This paper compares and analyzes several kinds of classical algorithms of image edge detection, including Roberts, Sobel, Prewitt, LOG and Canny with MATLAB tool.  ...  The pretty usefull and identical information contained in edge of sub-image enable edge detection to be the main approach to image analysis and recognition.  ...  Class Hierarchy Graph has a vast area of applications in design and development of optimization algorithms.  ... 
doi:10.9790/0661-0260104 fatcat:yaitwgmpg5djhbmek3ts3c7uzu

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
no feedback, and the other which is always binary, is driven from the first shift register, and has feedback.  ...  An algorithm which enables one to construct the machine from this relation using a series of matix-thoretic manipulations is described.  ... 
doi:10.1109/tc.1968.226455 fatcat:syhwt24pazahde6pjqsan47epq

A Survey on Graph-Based Deep Learning for Computational Histopathology [article]

David Ahmedt-Aristizabal, Mohammad Ali Armin, Simon Denman, Clinton Fookes, Lars Petersson
2021 arXiv   pre-print
In this review, we provide a conceptual grounding for graph analytics in digital pathology, including entity-graph construction and graph architectures, and present their current success for tumor localization  ...  With the remarkable success of representation learning for prediction problems, we have witnessed a rapid expansion of the use of machine learning and deep learning for the analysis of digital pathology  ...  Then, the tissue-graphs are processed by a GNN-Hash model designed to use a graph encoding, and stored in the retrieval database.  ... 
arXiv:2107.00272v2 fatcat:3eskkeref5ccniqsjgo3hqv2sa

From Supervenience to Superdupervenience: Meeting the Demands of a Material World

1993 Mind  
A. Famili  ...  , for many useful comments on an earlier draft of this paper.  ...  One can imagine a decomposition of a graph in a similar manner as the decomposition of an operand or operator [24, 26] .  ... 
doi:10.1093/mind/102.408.555 fatcat:aqjmty7ylvhxdeiuhihi2un7r4
« Previous Showing results 1 — 15 out of 336 results