DIKUL - logo

Rezultati iskanja

Osnovno iskanje    Izbirno iskanje   
Iskalna
zahteva
Knjižnica

Trenutno NISTE avtorizirani za dostop do e-virov UL. Za polni dostop se PRIJAVITE.

25 26 27
zadetkov: 265
261.
  • Exact algorithms for coupli... Exact algorithms for coupling capacitance minimization by adding one metal layer
    Hua Xiang; Kai-Yuan Chao; Wong, M.D.F. Sixth international symposium on quality electronic design (isqed'05), 2005
    Conference Proceeding

    Due to the rapid development of manufacturing process technology and tight marketing schedules, chip design and manufacturing always work towards an integrated solution to achieve an enhanced product ...
Celotno besedilo
Dostopno za: UL
262.
  • Some New Matroids on Graphs... Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
    Conforti, Michele; Rao, M. R Mathematics of operations research, 05/1987, Letnik: 12, Številka: 2
    Journal Article
    Recenzirano

    We define some new matroids on the edge set of a graph. We show that minimal disconnecting edge sets and minimal edge sets which cover all the odd cycles are cocircuits of a binary matroid. We give a ...
Celotno besedilo
Dostopno za: UL
263.
  • Computation with Polynomial... Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
    De Loera, Jesus A.; Malkin, Peter N.; Parrilo, Pablo A. Mixed Integer Nonlinear Programming
    Book Chapter
    Odprti dostop

    This is a survey of a recent methodology to solve systems of polynomial equations and inequalities for problems arising in combinatorial optimization. The techniques we discuss use the algebra of ...
Celotno besedilo

PDF
264.
  • Influences of minimum cut p... Influences of minimum cut plane properties on the mincut circuit partitioning problems
    Kuo-Hsing Cheng; Shun-Wen Cheng 9th International Conference on Electronics, Circuits and Systems, 2002, Letnik: 1
    Conference Proceeding

    Mincut partitioning aims to minimize the total cuts of edges by partitioning nodes into two sets. Two-way mincut partitioning is NP-complete. Previous methods only use node information and can only ...
Celotno besedilo
Dostopno za: UL
265.
  • A study on the relationship... A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning
    Kuo-Hsing Cheng; Shun-Wen Cheng ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483), 2001, Letnik: 2
    Conference Proceeding

    In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition/entropy on the V-E plain. If a circuit has higher initial ...
Celotno besedilo
Dostopno za: UL

Nalaganje filtrov