نتایج جستجو برای: traversing lines

تعداد نتایج: 220803  

Journal: :Journal of Graph Algorithms and Applications 2002

2010
Anders Nedergaard Jensen

We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle the same algorithm can be used for computing secondary fans, Gröbner fans, Tropical varieties and Minkowski sums up to symmetry. The algorithm has been implemented in the software Gfan.

2006
Danny Ziyi Chen Rudolf Fleischer Jian Li Haitao Wang Hong Zhu

Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag machining path for a given pocket (i.e., a planar domain). We give an optimal linear time dynamic programming algorithm for simply connected pockets, and a linear plus O(1) time optimal algorithm for pockets with h holes. If the...

1999
Murali Mani Alex Zelikovsky Gautam Bhatia Andrew B. Kahng

The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are probabilistic in nature. A probabilistic graph is one where there is a probability associated with the existence of every edge. We examine the problem of nding the best strategy for reaching a give...

2013
M. C. Bartholomew-Biggs

This paper considers a method for dealing with non-convex objective functions in optimization problems. It uses the Hessian matrix and combines features of trust-region techniques and continuous steepest descent trajectory-following in order to construct an algorithm which performs curvilinear searches away from the starting point of each iteration. A prototype implementation yields promising r...

2009
ION BUCUR NICOLAE CUPCEA ADRIAN SURPATEANU COSTIN STEFANESCU FLORIN RADULESCU

In this paper is presented a new approach for decreasing the power consumption in LUT based FPGA implemented circuits. The attempt is based on reducing logic activity among LUTs. In order to achieve this target it was used the probability approach that estimates the dynamic logic activity of each line in the circuit. Traversing circuits from primary inputs lines to the primary output lines, ste...

Journal: :Journal of Dynamics and Differential Equations 2020

Journal: :Nature Reviews Neuroscience 2016

Journal: :Current Biology 2012
Shixing Zhang Gregg Roman

Molecules that suppress memory formation protect against the consolidation of inaccurate information. A recent study in Drosophila has identified a new pathway for memory suppression and the neurons that are a gateway to long-term memory formation.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید