|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 36 occurrences of 32 keywords
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
33 | Ross A. Knepper, Matthew T. Mason |
Empirical Sampling of Path Sets for Local Area Motion Planning. |
ISER |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Ross A. Knepper, Matthew T. Mason |
Path diversity is only part of the problem. |
ICRA |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Michael D. Hendy, Sagi Snir |
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets. |
IEEE ACM Trans. Comput. Biol. Bioinform. |
2008 |
DBLP DOI BibTeX RDF |
Hadamard conjugation, K3ST model, path-sets, phylogenetic invariants, phylogenetic trees |
20 | Bin Liu, Fabrizio Lombardi, Wei-Kang Huang |
Testing programmable interconnect systems: an algorithmic approach. |
Asian Test Symposium |
2000 |
DBLP DOI BibTeX RDF |
programmable circuits, interconnected systems, programmable interconnect systems testing, algorithmic approach, programmable wiring networks, comprehensive fault model, network faults, open faults, switch faults, stuck-off faults, programming faults, minimal configuration number, node-disjoint path-sets, network adjacencies, post-processing algorithm, fault diagnosis, graphs, interconnections, fault detection, fault coverage, circuit analysis computing, stuck-at faults, switching, bridge faults, automatic test software, circuit testing, figure of merit, programming phases, stuck-on faults, short circuits |
19 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On shortest path representation. |
IEEE/ACM Trans. Netw. |
2007 |
DBLP DOI BibTeX RDF |
linear programming, traffic engineering, shortest path routing |
12 | Jie Luo 0001 |
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
11 | Glynn Winskel |
Name Generation and Linearity. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Bin Liu, Fabrizio Lombardi, Nohpill Park, Minsu Choi |
Testing Layered Interconnection Networks. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Fabrizio Lombardi, Nohpill Park |
Testing Layered Interconnection Networks. |
DFT |
2002 |
DBLP DOI BibTeX RDF |
Fault Tolerance, Interconnection Networks, Fault Detection, Network Flow, Switch |
10 | Umar S. Suryahatmaja, Mehdi Mrad, Mohamed Naceur Azaiez, Asma Ben Yaghlane, Anis Gharbi |
The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources. |
IEEE Trans. Netw. Serv. Manag. |
2023 |
DBLP DOI BibTeX RDF |
|
10 | Alfonsus Julanto Endharta, Won Young Yun, Young Myoung Ko |
Reliability evaluation of circular k-out-of-n: G balanced systems through minimal path sets. |
Reliab. Eng. Syst. Saf. |
2018 |
DBLP DOI BibTeX RDF |
|
10 | Jean-Luc Marichal |
Structure Functions and Minimal Path Sets. |
IEEE Trans. Reliab. |
2016 |
DBLP DOI BibTeX RDF |
|
10 | Sobhi Mejjaouli, Radu F. Babiceanu |
Minimal path sets models for reliability computation of wireless sensor networks. |
SysCon |
2016 |
DBLP DOI BibTeX RDF |
|
10 | William C. Abram, Jeffrey C. Lagarias |
Path sets in one-sided symbolic dynamics. |
Adv. Appl. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
10 | Doulkifli Boukraâ, Omar Boussaid, Fadila Bentayeb |
Vertical Fragmentation of XML Data Warehouses Using Frequent Path Sets. |
DaWaK |
2011 |
DBLP DOI BibTeX RDF |
|
10 | Ross A. Knepper, Siddhartha S. Srinivasa, Matthew T. Mason |
An Equivalence Relation for Local Path Sets. |
WAFR |
2010 |
DBLP DOI BibTeX RDF |
|
10 | Gábor Rétvári, Róbert Szabó, József Bíró |
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. |
NETWORKING |
2004 |
DBLP DOI BibTeX RDF |
routing, linear programming, Traffic engineering, OSPF |
10 | Ryuhei Uehara, Zhi-Zhong Chen, Xin He |
Fast RNC and NC Algorithms for Maximal Path Sets. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Zhi-Zhong Chen |
Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Michael D. Hendy |
The path sets of weighted partially labelled trees. |
Australas. J Comb. |
1992 |
DBLP BibTeX RDF |
|
9 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu, Suresh Rai |
A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network. |
PRDC |
2008 |
DBLP DOI BibTeX RDF |
|
9 | Alain Couchot |
Termination Analysis of Active Rules with Priorities. |
DEXA |
2003 |
DBLP DOI BibTeX RDF |
|
9 | Jun Xia, Li Luo, Xuejun Yang |
A 0-1 Integer Linear Programming Based Approach for Global Locality Optimizations. |
Asia-Pacific Computer Systems Architecture Conference |
2006 |
DBLP DOI BibTeX RDF |
compiler optimizations, integer linear programming, loop transformations, data transformations, Cache locality, memory layouts |
7 | Zareen Alamgir, Sarmad Abbasi |
Combinatorial Algorithms for Listing Paths in Minimal Change Order. |
CAAN |
2007 |
DBLP DOI BibTeX RDF |
Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph |
4 | Hiroki Matsutani, Michihiro Koibuchi, Hideharu Amano |
Tightly-Coupled Multi-Layer Topologies for 3-D NoCs. |
ICPP |
2007 |
DBLP DOI BibTeX RDF |
|
4 | Stefan Gossens, Mario Dal Cin |
A View-Based Control Flow Metric. |
COMPSAC Workshops |
2004 |
DBLP DOI BibTeX RDF |
|
4 | Abhijit M. Lele, S. K. Nandy 0001 |
Architecture of Reconfigurable a Low Power Gigabit AT Switch. |
VLSI Design |
2001 |
DBLP DOI BibTeX RDF |
|
4 | Carsten K. Gomard, Peter Sestoft |
Path Analysis for Lazy Data Structures. |
PLILP |
1992 |
DBLP DOI BibTeX RDF |
|
4 | L. Howard Holley, Barry K. Rosen |
Qualified Data Flow Problems. |
POPL |
1980 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|