Results 201 to 210 of about 153,305 (263)
Reprogrammable metamaterial robot with embodied versatile computation and mechanical intelligence. [PDF]
Nat CommunZhou W, Wang YZ.
europepmc +1 more source
Optimization of Sensor Network for Velocity-Free Acoustic Emission Source Localization in Construction Materials. [PDF]
Materials (Basel)Huang X, Liu Y, Yang L, Dong L.
europepmc +1 more source
Comparative analysis of maze complexity: implications for adult hippocampal neurogenesis. [PDF]
Front NeurosciKhalil MH.
europepmc +1 more source
Substantially lower estimates in China's offshore wind potential using farm-scale spatial modeling and wake effects. [PDF]
Nat CommunXu S +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Networks, 1978
AbstractThe problems of layout of printed circuits and large scale integrated chips are very complex and are therefore usually approached by heuristic methods.This paper presents a more analytic approach to an elementary subset of these problems, using combinatorial and graphtheoretic arguments.
M. Cutler, Yossi Shiloach
openaire +1 more source
AbstractThe problems of layout of printed circuits and large scale integrated chips are very complex and are therefore usually approached by heuristic methods.This paper presents a more analytic approach to an elementary subset of these problems, using combinatorial and graphtheoretic arguments.
M. Cutler, Yossi Shiloach
openaire +1 more source
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Consider the problem of laying out a set of $n$ images that match a query onto the nodes of a $\sqrt{n}\times\sqrt{n}$ grid. We are given a score for each image, as well as the distribution of patterns by which a user's eye scans the nodes of the grid and we wish to maximize the expected total score of images selected by the user.
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source
Consider the problem of laying out a set of $n$ images that match a query onto the nodes of a $\sqrt{n}\times\sqrt{n}$ grid. We are given a score for each image, as well as the distribution of patterns by which a user's eye scans the nodes of the grid and we wish to maximize the expected total score of images selected by the user.
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source
The layout synthesizer: an automatic Netlist-to-Layout system
Proceedings of the 1989 26th ACM/IEEE conference on Design automation conference - DAC '89, 1989A system generating compacted physical layouts from MOS transistor netlists has been developed. It uses a novel graph-theoretical placement algorithm to simultaneously maximize diffusion sharing and minimize the wiring area. The algorithm is not limited to circuits that have equal numbers of NMOS and PMOS transistors.
C. C. Chen, S.-L. Chow
openaire +1 more source
IEEE Symposium on Information Visualization, 2005. INFOVIS 2005., 2005
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges.
Doantam Phan +4 more
openaire +1 more source
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges.
Doantam Phan +4 more
openaire +1 more source
IEEE Transactions on Visualization and Computer Graphics, 2011
We introduce hi-trees, a new visual representation for hierarchical data in which, depending on the kind of parent node, the child relationship is represented using either containment or links. We give a drawing convention for hi-trees based on the standard layered drawing convention for rooted trees, then show how to extend standard bottom-up tree ...
Kim Marriott +4 more
openaire +2 more sources
We introduce hi-trees, a new visual representation for hierarchical data in which, depending on the kind of parent node, the child relationship is represented using either containment or links. We give a drawing convention for hi-trees based on the standard layered drawing convention for rooted trees, then show how to extend standard bottom-up tree ...
Kim Marriott +4 more
openaire +2 more sources