All items in category } Computing (85 videos)

• ⨘ } VLSI } 017 } CMOS Power Consumption }
• ⨘ } VLSI } 016 } Do You Write a Good RTL Code }
• VLSI } 015 } Static Timing Analysis
• VLSI } 014 } Latch-up & CMOS Technologies }
• VLSI } 013 } Floor-planning tips }
• VLSI } 012 } Metastability }
• VLSI } 011 } Clock Domain Crossing } Multi Voltage Domains }
• Algorithms } 045 } Ant Colony Optimization } Technique
• VLSI } 010 } Reset Domain Crossing (RDC) }
• VLSI } 009 } Clock Domain Crossings } FIFO }
• Algorithms } 044 } Ant Colony Optimization } Introduction }
• Turorials } Matlab | Octave } quick overview }
• Software Engineering } 007 } Agile versus Spiral }
• VLSI } 008 } Antenna Effects }
• Algorithms } 043 } Genetic Algorithms }
• Algorithms } 042 } Monte-Carlo Methods }
• VLSI } 007 } Logic Gates using Multiplexers }
• Algorithms } 04 } Bags, Queues, and Stacks }
• Algorithms } 040 } Computational Geometry }
• Algorithms } 039 } String Matching } Knuth-Morris-Pratt }
• Algorithms } 038 } String Matching } Finite Automata }
• Algorithms } 037 } String Matching }
• Tutorials } System Verilog } Assertions }
• VLSI } 006 } Timing }
• Algorithms } 036 } Greatest Common Divisor (GCD) }
• Algorithms } 035 } Linear Programming } Simplex Algorithm }
• Algorithms } 034 } Solving Linear Equations }
• Tutorials } vi Editor: quick guide }
• Algorithms } 033 } Parallel Algorithms }
• Algorithms } 032 } Graphs } Flow Networks } Push-Relabel }
• Algorithms } 031 } Graphs } Flow Networks } Edmonds-Karp }
• Algorithms } 030 } Graphs } Flow Networks } Ford-Fulkerson }
• Algorithms } 029 } Graphs } Dijkstra’s algorithm }
• Algorithms } 028 } Graphs } The Bellman-Ford Algorithm }
• Algorithms } 027 } Graphs } Minimum Spanning Tree } Prim }
• Algorithms } 026 } Graphs } Minimum Spanning Tree } Kruskal }
• Algorithms } 025 } Graphs } Minimum Spanning Tree } Introduction }