|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 672 occurrences of 452 keywords
|
|
|
|
|
Results
Found 647 publication records. Showing 647 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Sanjeet Singh, Pankaj Gupta, Davinder Bhatia |
On Multiparametric Sensitivity Analysis in Minimum Cost Network Flow Problem.  |
ICCSA  |
2005 |
DBLP DOI BibTeX RDF |
multicommodity minimum cost network flow, multiparametric sensitivity analysis, tolerance approach, parametric analysis, Minimum cost network flow |
| 3 | Minsik Cho, Haoxing Ren, Hua Xiang, Ruchir Puri |
History-based VLSI legalization using network flow.  |
DAC  |
2010 |
DBLP DOI BibTeX RDF |
VLSI, placement, network flow, legalization |
| 3 | Steffen Rebennack, Artyom G. Nahapetyan, Panos M. Pardalos |
Bilinear modeling solution approach for fixed charge network flow problems.  |
Optimization Letters  |
2009 |
DBLP DOI BibTeX RDF |
Fixed charge network flow problem, Exact formulation, Bilinear modeling, Concave minimization |
| 3 | Yoram Bachrach, Jeffrey S. Rosenschein |
Power in threshold network flow games.  |
Autonomous Agents and Multi-Agent Systems  |
2009 |
DBLP DOI BibTeX RDF |
Power index, Network flow, Network reliability, Coalitional games |
| 3 | Tan Yan, Martin D. F. Wong |
A correct network flow model for escape routing.  |
DAC  |
2009 |
DBLP DOI BibTeX RDF |
PCB routing, diagonal capacity, missing pin, package routing, network flow, escape routing |
| 3 | Shantanu Dutt, Yang Dai, Huan Ren, Joel Fontanarosa |
Selection of Multiple SNPs in Case-Control Association Study Using a Discretized Network Flow Approach.  |
BICoB  |
2009 |
DBLP DOI BibTeX RDF |
Multiple SNPs, Case-Control Study, Discretized Network Flow, Optimization |
| 3 | Cornelius Toole, Andrei Hutanu |
Network flow based resource brokering and optimization techniques for distributed data streaming over optical networks.  |
Mardi Gras Conference  |
2008 |
DBLP DOI BibTeX RDF |
maximum network flow, remote data access, resource brokering, optical grids |
| 3 | Ziming Zhuang, Silviu Cucerzan, C. Lee Giles |
Network Flow for Collaborative Ranking.  |
PKDD  |
2006 |
DBLP DOI BibTeX RDF |
Collaborative ranking, FlowRank, Graph theory, Network flow, Graph models, User feedback |
| 3 | Haiyan Lu, Enyu Yao, Liqun Qi |
Some further results on minimum distribution cost flow problems.  |
J. Comb. Optim.  |
2006 |
DBLP DOI BibTeX RDF |
Manufacturing network flow, Network simplex algorithm, Networks with side constraints, Minimum cost network flow |
| 3 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.  |
Algorithmica  |
2004 |
DBLP DOI BibTeX RDF |
Convex integer programming, Total unimodularity, Network flow, Minimum cut, Nonlinear integer programming |
| 3 | Ying Liu, Alan P. Sprague, Elliot Lefkowitz |
Network flow for outlier detection.  |
ACM Southeast Regional Conference  |
2004 |
DBLP DOI BibTeX RDF |
Maximum Flow Minimum Cut, data mining, graph theory, network flow, outlier detection |
| 3 | Wonjoon Choi, Kia Bazargan |
Hierarchical Global Floorplacement Using Simulated Annealing and Network Flow Area Migration.  |
DATE  |
2003 |
DBLP DOI BibTeX RDF |
floorplacement, global placement, area migration, Design, Algorithms, simulated annealing, Management, Floorplanning, network flow, hierarchical, Placement and routing |
| 3 | Bruno Codenotti, Roberto Tamassia |
A Network Flow Approach to the Reconfiguration of VLSI Arrays.  |
IEEE Trans. Computers  |
1991 |
DBLP DOI BibTeX RDF |
network flow approach, VLSI arrays, faulty cells, network flow model, functional cells, fault-free array, Manhattan model, VLSI, reconfiguration, systolic arrays, fault location |
| 2 | Bo Hong, Zhengyu He |
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic.  |
IEEE Trans. Parallel Distrib. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
Maximum network flow, parallel algorithm, multithreading, lock-free |
| 2 | Chi-Yuan Chen, Yu-Chuan Lin, Yao-Hsin Chou, Han-Chieh Chao |
Using Quantum Search to Solve Dynamic Maximum Network Flow Problem.  |
ISPA  |
2011 |
DBLP DOI BibTeX RDF |
Quantum Computing, Quantum Search, Network Flow Problem |
| 2 | Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu |
Multiline Addressing by Network Flow.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, Network design, Matrix decomposition, Algorithm engineering, OLED |
| 2 | Dukwon Kim |
Piecewise Linear Network Flow Problems.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Piecewise linear arc cost, Fixed charge, Global optimization, Minimum cost network flow |
| 2 | Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein |
The Cost of Stability in Network Flow Games.  |
MFCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Bei Yu, Sheqin Dong, Satoshi Goto, Song Chen |
Voltage-island driven floorplanning considering level-shifter positions.  |
ACM Great Lakes Symposium on VLSI  |
2009 |
DBLP DOI BibTeX RDF |
convex network flow, level shifter assignment, voltage assignment, white space redistribution, voltage-island |
| 2 | Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-Seng Chua |
Scalable detection of partial near-duplicate videos by visual-temporal consistency.  |
ACM Multimedia  |
2009 |
DBLP DOI BibTeX RDF |
partial near-duplicate, network flow, temporal graph |
| 2 | Siriphong Lawphongpanich |
Simplicial Decomposition.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Carathéodory theorem, first order Taylor series expansion, Frank-Wolfe algorithm, Inner linearization, Master problem, Node-arc incidence matrix, Nonlinear dynamic network flow problem, Nonlinear multicommodity flow problems, Nonlinear single commodity network flow problem, Polyhedral set, Positive definite matrix, Pseudoconvexity, P-simplex, regularized Frank-Wolfe algorithm, Regularized subproblem, Restricted simplicial decomposition, Simplicial decomposition, Subproblem, Superlinear convergent rate, Traffic assignment problem, Side constraints, Linear program, Rank, Globally optimal, Convex hull, Nonlinear programming, Nonlinear program, Dimension, Column generation, Shortest path problem, Polyhedron, Restriction, Simplex algorithm, Extreme point, Dantzig-Wolfe decomposition, Convex combinations |
| 2 | Zhe-Wei Jiang, Yao-Wen Chang |
An Optimal Network-Flow-Based Simultaneous Diode and Jumper Insertion Algorithm for Antenna Fixing.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang |
BioRoute: A Network-Flow-Based Routing Algorithm for the Synthesis of Digital Microfluidic Biochips.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Xiaolin Wu, Bin Ma, Nima Sarshar |
Rainbow Network Flow of Multiple Description Codes.  |
IEEE Transactions on Information Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Tien-Yuan Hsu, Ting-Chi Wang |
A generalized network flow based algorithm for power-aware FPGA memory mapping.  |
DAC  |
2008 |
DBLP DOI BibTeX RDF |
FPGA, dynamic power, memory mapping |
| 2 | Jason Cong, Junjuan Xu |
Simultaneous FU and Register Binding Based on Network Flow Method.  |
DATE  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Qiang Ma 0002, Evangeline F. Y. Young |
Network flow-based power optimization under timing constraints in MSV-driven floorplanning.  |
ICCAD  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Lun-Chun Wei, Hung-Ming Chen, Li-Da Huang, Sarah Songjie Xu |
Efficient and optimal post-layout double-cut via insertion by network relaxation and min-cost maximum flow.  |
ACM Great Lakes Symposium on VLSI  |
2008 |
DBLP DOI BibTeX RDF |
redundant via insertion, network flow, relaxation |
| 2 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
| 2 | Dharmashankar Subramanian, Lianjun An |
Optimal Resource Action Planning Analytics for Services Delivery Using Hiring, Contracting & Cross-Training of Various Skills.  |
IEEE SCC  |
2008 |
DBLP DOI BibTeX RDF |
Resource Action Planning, Cross-Training, Services, Contracting, Network Flow, Skills, Hiring |
| 2 | Hélia Pouyllau, Stefan Haar |
Distributed Busacker-Gowen algorithm for end-to-end QoS pipe negotiation in X-domain networks.  |
Annales des Télécommunications  |
2008 |
DBLP DOI BibTeX RDF |
Inter-AS, QoS pipes, Busacker-Gowen algorithm, Distributed algorithms, Negotiation, SLA, Network flow, End-to-end QoS |
| 2 | Shangyao Yan, Chia-Hung Chen |
Optimal flight scheduling models for cargo airlines under alliances.  |
J. Scheduling  |
2008 |
DBLP DOI BibTeX RDF |
Cargo, Airport selection, Fleet routing, Multiple commodity network flow problem, Scheduling, Alliance |
| 2 | Jia-Wei Fang, I-Jye Lin, Yao-Wen Chang, Jyh-Herng Wang |
A Network-Flow-Based RDL Routing Algorithmz for Flip-Chip Design.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | D. Andreou, Konstantinos Paparrizos, Nikolaos Samaras, Angelo Sifaleras |
Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem.  |
Operational Research  |
2007 |
DBLP DOI BibTeX RDF |
Web-based Educational Software, Combinatorial Optimization, Operational Research |
| 2 | Günter Rote, Martin Zachariasen |
Matrix scaling by network flow.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Guang Cheng, Yongning Tang, Wei Ding 0001 |
A Double-Sampling and Hold Based Approach for Accurate and Efficient Network Flow Monitoring.  |
International Conference on Computational Science  |
2007 |
DBLP DOI BibTeX RDF |
Measurement, Internet Traffic, Sampling Methods |
| 2 | Xiao-Fan Zhi, Zhi-Cheng Liao, Jian-Xiong Lu |
The Study of Multi-agent Network Flow Architecture for Application Performance Evaluation.  |
KES-AMSTA  |
2007 |
DBLP DOI BibTeX RDF |
performance evaluation architecture, multi-agent, network flow |
| 2 | Doantam Phan, J. Gerth, M. Lee, Andreas Paepcke, Terry Winograd |
Visual Analysis of Network Flow Data with Timelines and Event Plots.  |
VizSEC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Chuan Lin, Aiguo Xie, Hai Zhou |
Design closure driven delay relaxation based on convex cost network flow.  |
DATE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Yoram Bachrach, Jeffrey S. Rosenschein |
Computing the Banzhaf power index in network flow games.  |
AAMAS  |
2007 |
DBLP DOI BibTeX RDF |
power indices, computational complexity, voting |
| 2 | Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang |
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips.  |
ICCAD  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Simha Sethumadhavan, Franziska Roesner, Joel S. Emer, Doug Burger, Stephen W. Keckler |
Late-binding: enabling unordered load-store queues.  |
ISCA  |
2007 |
DBLP DOI BibTeX RDF |
network flow control, memory disambiguation, late binding |
| 2 | P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
Degree-constrained network flows.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
congestion, network flow |
| 2 | Carlos F. Daganzo, Karen R. Smilowitz |
A note on asymptotic formulae for one-dimensional network flow problems.  |
Annals OR  |
2006 |
DBLP DOI BibTeX RDF |
Transportation problem, Distance approximations |
| 2 | Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu |
Multiline Addressing by Network Flow.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Kees Joost Batenburg |
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections.  |
DGCI  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Dae-Sik Choi, In-Chan Choi |
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem.  |
COCOON  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Shantanu Dutt, Huan Ren, Fenghua Yuan, Vishal Suthar |
A network-flow approach to timing-driven incremental placement for ASICs.  |
ICCAD  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Pilok Lim, Taewhan Kim |
Thermal-aware high-level synthesis based on network flow method.  |
CODES+ISSS  |
2006 |
DBLP DOI BibTeX RDF |
power consumption, temperature, binding |
| 2 | Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal |
Learning to rank networked entities.  |
KDD  |
2006 |
DBLP DOI BibTeX RDF |
conductance matrix, pagerank, network flow, maximum entropy |
| 2 | Li Yang |
Building k-Connected Neighborhood Graphs for Isometric Data Embedding.  |
IEEE Trans. Pattern Anal. Mach. Intell.  |
2006 |
DBLP DOI BibTeX RDF |
network flow, manifold learning, graph connectivity, Data embedding |
| 2 | Alan Robinson, Yupo Chan, Dennis C. Dietz |
Detecting a Security Disturbance in Multi Commodity Stochastic Networks.  |
Telecommunication Systems  |
2006 |
DBLP DOI BibTeX RDF |
Multi commodity network-flow, Origin-destination estimation, Non-parametric statistics, Network security, Facility location, Stochastic network |
| 2 | Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng |
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.  |
ISPAN  |
2005 |
DBLP DOI BibTeX RDF |
algorithm, reliability, complexity, Networks, graph, shortest path, survivability, network flow, protection, disjoint paths, minimum cost network flow |
| 2 | Yonghong Song, Cheng Wang, Zhiyuan Li |
A Polynomial-Time Algorithm for Memory Space Reduction.  |
International Journal of Parallel Programming  |
2005 |
DBLP DOI BibTeX RDF |
optimization, Compilers, graph theory, network flow problem |
| 2 | Vishnu Swaminathan, Krishnendu Chakrabarty |
Network flow techniques for dynamic voltage scaling in hard real-time systems.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Zhengping Ma, Deguang Cui, Peng Cheng |
Dynamic network flow model for short-term air traffic flow management.  |
IEEE Transactions on Systems, Man, and Cybernetics, Part A  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Reid Andersen, Fan R. K. Chung, Lincoln Lu |
Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract).  |
WAW  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Xujin Chen, Wenan Zang |
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
feedback set, cycle packing, algorithm, complexity, network flow |
| 2 | Chun-Gi Lyuh, Taewhan Kim |
High-level synthesis for low power based on network flow method.  |
IEEE Trans. VLSI Syst.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Sandeep Koranne |
Solving the SoC Test Scheduling Problem Using Network Flow and Reconfigurable Wrappers.  |
ISQED  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Elif Akçali, Alper Üngör |
Approximation Algorithms for Degree-Constrained Bipartite Network Flow.  |
ISCIS  |
2003 |
DBLP DOI BibTeX RDF |
capacity allocation}, scheduling, Approximation algorithms, network flows |
| 2 | Vishnu Swaminathan, Krishnendu Chakrabarty |
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems.  |
ICCAD  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Alexander Hall, Steffen Hippler, Martin Skutella |
Multicommodity Flows over Time: Efficient Algorithms and Complexity.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
flow over time, dynamic flow, routing, complexity, network flow, efficient algorithm |
| 2 | Hak-Jin Kim, John N. Hooker |
Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach.  |
Annals OR  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Catherine H. Gebotys |
A network flow approach to memory bandwidth utilization in embedded DSP core processors.  |
IEEE Trans. VLSI Syst.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Jun Han, Graham McMahon, Stephen Sugden |
A Branch and Bound Algorithm for Minimum Cost Network Flow Problem.  |
IDEAL  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zhang |
Adjusted Network Flow for the Shelf-Space Allocation Problem.  |
ICTAI  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Fabrizio Lombardi, Nohpill Park |
Testing Layered Interconnection Networks. (PDF / PS)  |
DFT  |
2002 |
DBLP DOI BibTeX RDF |
Fault Tolerance, Interconnection Networks, Fault Detection, Network Flow, Switch |
| 2 | Dan Gusfield, Charles U. Martel |
The Structure and Complexity of Sports Elimination Numbers.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
Algorithms, Combinatorial optimization, Network flow, Sports, Baseball |
| 2 | Masoud Alghoniemy, Ahmed H. Tewfik |
A Network Flow Model for Playlist Generation.  |
ICME  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun |
Network Flow Problems in Constraint Programming.  |
CP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng |
Membership for Core of LP Games and Other Games.  |
COCOON  |
2001 |
DBLP DOI BibTeX RDF |
linear programming, NP-completeness, network flow, Steiner tree, core, cooperative game |
| 2 | Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh |
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.  |
IPCO  |
2001 |
DBLP DOI BibTeX RDF |
capacitated lot-sizing, fixed charge network flow, Mixed integer programming, polyhedral combinatorics, production planning, setup times |
| 2 | Roberto Battiti, Marco Protasi |
Reactive Local Search for the Maximum Clique Problem.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
Algorithms, Combinatorial optimization, Network flow, Sports, Baseball |
| 2 | Lianyuan Li, Zemin Liu, Zheng Zhou |
A Hopfield Neural Network Flow Classifier in IP Switching.  |
IJCNN  |
2000 |
DBLP DOI BibTeX RDF |
IP switching, neural network, flow classification |
| 2 | Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta |
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow.  |
SIGMETRICS  |
2000 |
DBLP DOI BibTeX RDF |
traffic engineering, network flow, Steiner tree, multicast routing |
| 2 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
Solving the Convex Cost Integer Dual Network Flow Problem.  |
IPCO  |
1999 |
DBLP DOI BibTeX RDF |
|
| 2 | Nihar R. Mahapatra, Shantanu Dutt |
Efficient Network-Flow Based Techniques for Dynamic Fault Reconfiguration in FPGAs.  |
FTCS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 2 | Huiqun Liu, Martin D. F. Wong |
Network-flow-based multiway partitioning with area and pin constraints.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
1998 |
DBLP DOI BibTeX RDF |
|
| 2 | Ming-Ter Kuo, Chung-Kuan Cheng |
A Network Flow Approach for Hierarchical Tree Partitioning.  |
DAC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 2 | Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young |
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.  |
IPCO  |
1996 |
DBLP DOI BibTeX RDF |
|
| 2 | Paul Tseng, Dimitri P. Bertsekas |
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.  |
IPCO  |
1996 |
DBLP DOI BibTeX RDF |
|
| 2 | Sanjay Khanna, Shaodi Gao, Krishnaiyan Thulasiraman |
Parallel hierarchical global routing for general cell layout.  |
Great Lakes Symposium on VLSI  |
1995 |
DBLP DOI BibTeX RDF |
parallel hierarchical global routing, general cell layout, hierarchical decomposition strategy, network flow optimization, parallel algorithms, parallel processing, VLSI, integer programming, integer programming, routing algorithm, network routing, circuit layout CAD, integrated circuit layout, shared-memory machine |
| 2 | Yao-Wen Chang, D. F. Wong, C. K. Wong |
Design and analysis of FPGA/FPIC switch modules. (PDF / PS)  |
ICCD  |
1995 |
DBLP DOI BibTeX RDF |
FPGA/FPIC switch modules, routing resources, FPIC, network-flow techniques, field programmable interconnect chip, field programmable gate arrays, FPGA, field programmable gate arrays, logic design, heuristic algorithm, programmable logic arrays, routability |
| 2 | Prathima Agrawal, Antony Ng |
Computing Network Flow on a Multiple Processor Pipeline.  |
IEEE Trans. Parallel Distrib. Syst.  |
1994 |
DBLP DOI BibTeX RDF |
multiple processor pipeline, Goldberg-Tarjan algorithm, network graph, six processors, distributed algorithms, graph theory, network flow, pipeline processing, parallel implementations, performance estimates, maximum flow, partitioned algorithm, message-passing multicomputer |
| 2 | Konrad Doll, Frank M. Johannes, Kurt Antreich |
Iterative placement improvement by network flow methods.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
1994 |
DBLP DOI BibTeX RDF |
|
| 2 | Honghua Yang, D. F. Wong |
Efficient network flow based min-cut balanced partitioning.  |
ICCAD  |
1994 |
DBLP DOI BibTeX RDF |
|
| 2 | Shahid H. Bokhari |
A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers.  |
IEEE Trans. Parallel Distrib. Syst.  |
1993 |
DBLP DOI BibTeX RDF |
network flow model, circuit-switched multicomputers, minimum cost flow algorithm, contention free matching, load balancing, concurrency control, hypercube, multiprocessing systems, hypercube networks, wormhole routing |
| 2 | Tomasz Radzik |
Faster Algorithms for the Generalized Network Flow Problem  |
FOCS  |
1993 |
DBLP DOI BibTeX RDF |
faster algorithms, generalized network flow problem, gain factors, approximate generalized flow problem, linear programming, capacities, approximation scheme |
| 2 | Cheol-Hoon Lee, Dongmyun Lee, Myunghwan Kim |
Optimal Task Assignment in Linear Array Networks.  |
IEEE Trans. Computers  |
1992 |
DBLP DOI BibTeX RDF |
optimal task assignment, linear array networks, network flow approach, two-terminal network flow problem, computational complexity, distributed processing, NP-complete, computer networks, communication costs, task assignment, distributed computing system |
| 2 | Joseph Cheriyan, S. N. Maheshwari |
Analysis of Preflow Push Algorithms for Maximum Network Flow.  |
FSTTCS  |
1988 |
DBLP DOI BibTeX RDF |
|
| 2 | H. T. Lau |
An application of network flow programming to locate concentrators in a communication network.  |
ACM Conference on Computer Science  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari, Paolo Serafini |
Network flow methods for electoral systems.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jingjin Yu, Steven M. LaValle |
Multi-agent Path Planning and Network Flow  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Negar Kiyavash, Amir Houmansadr, Nikita Borisov |
Multi-Flow Attacks Against Network Flow Watermarks: Analysis and Countermeasures  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Rinehart, Munther A. Dahleh |
The value of side information in network flow optimization.  |
Systems & Control Letters  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kan Wang, Sheqin Dong, Yuchun Ma, Satoshi Goto, Jason Cong |
Leakage-aware performance-driven TSV-planning based on network flow algorithm in 3D ICs.  |
ISQED  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas C. Sharkey |
Network flow problems with pricing decisions.  |
Optimization Letters  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Büsing, Sebastian Stiller |
Line planning, path constrained network flow and inapproximability.  |
Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shangyao Yan, Yu-Lin Shih, Wang-Tsang Lee |
A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems.  |
J. Global Optimization  |
2011 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 647 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ >>] |
|