Back to Results
First PageMeta Content
Operations research / Computational complexity theory / Convex optimization / Linear programming / Polyhedron / Mathematical optimization / Approximation algorithm / Simplex algorithm / Algorithm / Theoretical computer science / Applied mathematics / Mathematics


Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University
Add to Reading List

Document Date: 2011-03-29 07:21:24

Open Document

File Size: 139,48 KB

Share Result on Facebook

City

Paphos / New York / Pisa / Washington / DC / Two Farkas / Berlin / Constraint Logic / Farkas / /

Company

John Wiley & Sons Inc. / Vertex / /

Country

Italy / Cyprus / United States / /

Currency

pence / /

/

Facility

Pouchet’s FM library / /

IndustryTerm

algorithm / simplex algorithm / polynomial time algorithms / particular parallelization algorithm / resultant sub-systems / linear programming algorithm / approximation algorithm / sub-systems / polynomial combinatorial algorithm / affine transformation algorithms / over-approximation algorithm / polynomial time combinatorial algorithm / large polyhedral process networks / under-approximation algorithms / above algorithm / polynomial algorithm / unscalable algorithms / non-affine transformation algorithms / polynomial algorithms / polynomial-time algorithms / classical nonparametric algorithms / affine scheduling algorithm / polynomial time algorithm / polyhedral compilation tools / operation research algorithms / polyhedral systems / parametric linear programming algorithm / min-cost-flow algorithms / computing / linear programming solution / /

Organization

NPC UTVPI / IEEE Computer Society / /

Person

Yossi Shiloach / Nimrod Megiddo / Paul Feautrier / Antoine Min / Alain Darte / Howe Simon / A. King / Jacob M. Howe / Saman P. Amarasinghe / Armin Gr¨oßlinger / Albert Cohen / Uday Bondhugula / David A. Padua / Dorit S. Hochbaum / Qing Yang / Andy King / Shang-Hua Teng / Vincent Laviron / Daniel A. Spielman / Robert Claris / Patricia M. Hill / P. Sadayappan / Robert Shostak / A. Simon / Enea Zaffanella / Tanguy Risset / Elliot K. Kolodner / J. Ramanujam / Corinne Ancourt / Axel Simon / Albert Hartono / Roberto Bagnara / David Gelernter / Shmuel Sagiv / Wen Tseng / Sanjay V. Rajopadhye / Patrice Quinton / Jordi Cortadella / Kevin D. Wayne / Bengt Aspvall / Richard Fujimoto / Vasanth Balasundaram / Utpal Banerjee / Mohamed-Walid Benabderrahmane / Stephan Balev / Alexandru Nicolau / Vincent Van Dongen / Francesco Logozzo / S. Purushothaman / Edith Cohen / Martin Griebl / Nicolas Vasilache / Yves Robert / J. M. Howe / Joseph Naor / Ken Kennedy / Alexander Schrijver / /

Position

editor / Forward Communication / King / /

ProgrammingLanguage

DC / /

ProvinceOrState

New York / /

PublishedMedium

Lecture Notes in Computer Science / /

RadioStation

LP-FEAS FM / /

Technology

using simplex algorithm / same algorithms / above algorithm / 2.4 Algorithms / min-cost-flow algorithms / polyhedral Darte-Vivien algorithm / LP algorithm / method The Darte-Vivien algorithm / Feautrier-like scheduling algorithm / polynomial time algorithm / TVPI algorithms / Floyd-Warshall algorithm / simplex algorithm / particular parallelization algorithm / under-approximation algorithms / over-approximation algorithm / tiling-centric Pluto algorithm / polynomial algorithms / scheduling algorithm / DBMs / affine scheduling algorithm / Fouriermial algorithms / polynomial combinatorial algorithm / already developed algorithm / two algorithms / polynomial algorithm / strongly polynomial-time algorithms / affine transformation algorithms / operation research algorithms / java / classical nonparametric algorithms / approximation algorithm / polynomial time combinatorial algorithm / Feautrier-TVPI algorithm / linear programming algorithm / asymptotically unscalable algorithms / parametric linear programming algorithm / nonparametric TVPI algorithms / non-affine transformation algorithms / polynomial time algorithms / Darte-Vivien algorithm / /

SocialTag