Anthony Vannelli

According to our database1, Anthony Vannelli authored at least 47 papers between 1985 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Novel Congestion-estimation and Routability-prediction Methods based on Machine Learning for Modern FPGAs.
ACM Trans. Reconfigurable Technol. Syst., 2019

2018
GPlace3.0: Routability-Driven Analytic Placer for UltraScale FPGA Architectures.
ACM Trans. Design Autom. Electr. Syst., 2018

Machine-Learning Based Congestion Estimation for Modern FPGAs.
Proceedings of the 28th International Conference on Field Programmable Logic and Applications, 2018

2016
GPlace: a congestion-aware placement tool for ultrascale FPGAs.
Proceedings of the 35th International Conference on Computer-Aided Design, 2016

2015
Modified orbital branching for structured symmetry with an application to unit commitment.
Math. Program., 2015

2012
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.
Optim. Methods Softw., 2012

2011
A convex optimisation framework for the unequal-areas facility layout problem.
Eur. J. Oper. Res., 2011

2010
A Power-Efficient Multipin ILP-Based Routing Technique.
IEEE Trans. Circuits Syst. I Regul. Pap., 2010

On Interior-Point Warmstarts for Linear and Combinatorial Optimization.
SIAM J. Optim., 2010

An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization.
Electron. Notes Discret. Math., 2010

Tight mixed integer linear programming formulations for generator Self-Scheduling.
Proceedings of the 23rd Canadian Conference on Electrical and Computer Engineering, 2010

2008
Packing trees in communication networks.
J. Comb. Optim., 2008

A nonlinear optimization methodology for VLSI fixed-outline floorplanning.
J. Comb. Optim., 2008

Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.
INFORMS J. Comput., 2008

On routing in VLSI design and communication networks.
Discret. Appl. Math., 2008

Large-scale fixed-outline floorplanning design using convex optimization techniques.
Proceedings of the 13th Asia South Pacific Design Automation Conference, 2008

2007
An ILP based hierarchical global routing approach for VLSI ASIC design.
Optim. Lett., 2007

2006
Using Eigenvectors to Partition Circuits.
INFORMS J. Comput., 2006

Integer Linear Programming Models for Global Routing.
INFORMS J. Comput., 2006

A New Mathematical-Programming Framework for Facility-Layout Design.
INFORMS J. Comput., 2006

2005
A semidefinite optimization approach for the single-row layout problem with unequal dimensions.
Discret. Optim., 2005

On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems.
Proceedings of the Operations Research Proceedings 2005, 2005

Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization.
Proceedings of the 5th IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC 2005), 2005

2004
Engineering details of a stable force-directed placer.
Proceedings of the 2004 International Conference on Computer-Aided Design, 2004

2003
Tabu Search: Implementation & Complexity Analysis for Netlist Partitioning.
Int. J. Comput. Their Appl., 2003

InterconnectionModelling Using Distributed RLC Models.
Proceedings of the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 30 June, 2003

Steiner Tree Construction Based on Congestion for the Global Routing Problem.
Proceedings of the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 30 June, 2003

2002
An Attractor-Repeller approach to floorplanning.
Math. Methods Oper. Res., 2002

A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout.
J. Comb. Optim., 2002

2000
Tabu Search: A Meta Heuristic for Netlist Partitioning.
VLSI Design, 2000

1999
VLSI concentric partitioning using interior point quadratic programming.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Attractor-repeller approach for global placement.
Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999

1998
A nonlinear programming and local improvement method for standard cell placement.
Proceedings of the IEEE 1998 Custom Integrated Circuits Conference, 1998

1997
Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning.
J. Heuristics, 1997

1996
A GRASP clustering technique for circuit partitioning.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1995
Generating Lower Bounds for the Linear Arrangement Problem.
Discret. Appl. Math., 1995

1994
Interior Point Methods for Placement.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

1993
Analog neural network building blocks based on current mode subthreshold operation.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Circuit Partitioning Using a Tabu Search Approach.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Advanced Search Techniques for Circuit Partitioning.
Proceedings of the Quadratic Assignment and Related Problems, 1993

1992
An efficient eigenvector approach for finding netlist partitions.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992

1991
Group delay as an estimate of delay in logic.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

An adaptation of the interior point method for solving the global routing problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

A Parallel Implementation of an Interior Point Method for Linear Programming.
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1988
A New Heuristic for Partitioning the Nodes of a Graph.
SIAM J. Discret. Math., 1988

1985
Grouping problem in scheduling flexible manufacturing systems.
Robotica, 1985

Maximal lyapunov functions and domains of attraction for autonomous nonlinear systems.
Autom., 1985


  Loading...