Sciweavers

3838 search results - page 49 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
PADS
2004
ACM
15 years 3 months ago
Optimizing Parallel Execution of Detailed Wireless Network Simulation
With Parallel and Discrete Event Simulation (PDES) techniques, the runtime performance of detailed wireless network simulation can be improved significantly without compromising ...
Zhengrong Ji, Junlan Zhou, Mineo Takai, Jay Martin...
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 1 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
ACL
2006
14 years 11 months ago
Semantic Taxonomy Induction from Heterogenous Evidence
We propose a novel algorithm for inducing semantic taxonomies. Previous algorithms for taxonomy induction have typically focused on independent classifiers for discovering new sin...
Rion Snow, Daniel Jurafsky, Andrew Y. Ng
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick