Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Sunghyun Lee, Kiyoung Choi, Sungjoo Yoo	An intra-task dynamic voltage scaling method for SoC design with hierarchical FSM and synchronous dataflow model.	ISLPED	2002	DBLP DOI BibTeX RDF	variable supply voltage, low power, finite state machine, dynamic voltage scaling, formal model, synchronous dataflow
16	John Markus Bjørndalen, Otto J. Anshus, Tore Larsen, Lars Ailo Bongo, Brian Vinter	Scalable Processing and Communication Performance in a Multi-Media Related Context.	EUROMICRO	2002	DBLP DOI BibTeX RDF
16	David M. Harris, Sam Naffziger	Statistical clock skew modeling with data delay variations.	IEEE Trans. Very Large Scale Integr. Syst.	2001	DBLP DOI BibTeX RDF
16	Arun Krishnamachary, Jacob A. Abraham, Raghuram S. Tupuri	Timing Verification and Delay Test Generation for Hierarchical Designs.	VLSI Design	2001	DBLP DOI BibTeX RDF
16	Luciano Margara, Janos Simon	Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link.	ICALP	2000	DBLP DOI BibTeX RDF
16	Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano	Randomized path coloring on binary trees.	APPROX	2000	DBLP DOI BibTeX RDF
16	Savithri Sundareswaran, David T. Blaauw, Abhijit Dharchoudhury	A Three-Tier Assertion Technique for Spice Verification of Transistor Level Timing Analysis.	VLSI Design	1999	DBLP DOI BibTeX RDF	spice verification, primary-path, secondary-path, timing analysis, assertion, assertibility
16	Luisa Gargano	Limited Wavelength Conversion in All-Optical Tree Networks.	ICALP	1998	DBLP DOI BibTeX RDF
16	Katzalin Olcoz, Francisco Tirado	Register Allocation with Simultaneous BIST Intrusio.	EUROMICRO	1998	DBLP DOI BibTeX RDF
16	Jeffrey X. Su, David L. Dill, Jens U. Skakkebæk	Formally Verifying Data and Control with Weak Reachability Invariants.	FMCAD	1998	DBLP DOI BibTeX RDF
16	Yau-Tsun Steven Li, Sharad Malik	Performance analysis of embedded software using implicit path enumeration.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
16	Rajiv Gupta 0001, David A. Berson, Jesse Zhixi Fang	Path Profile Guided Partial Dead Code Elimation Using Predication.	IEEE PACT	1997	DBLP DOI BibTeX RDF
16	Pramod V. Koppol, Kuo-Chung Tai	An Incremental Approach to Structural Testing of Concurrent Software.	ISSTA	1996	DBLP DOI BibTeX RDF
16	Yau-Tsun Steven Li, Sharad Malik	Performance Analysis of Embedded Software Using Implicit Path Enumeration.	Workshop on Languages, Compilers, & Tools for Real-Time Systems	1995	DBLP DOI BibTeX RDF
16	Friedhelm Meyer auf der Heide, Berthold Vöcking	A Packet Routing Protocol for Arbitrary Networks.	STACS	1995	DBLP DOI BibTeX RDF
16	Jochen Behrens, J. J. Garcia-Luna-Aceves	Distributed, Scalable Routing Based on Link-State Vectors.	SIGCOMM	1994	DBLP DOI BibTeX RDF
16	Jeffrey D. Ullman, Mihalis Yannakakis	The Input/Output Complexity of Transitive Closure.	SIGMOD Conference	1990	DBLP DOI BibTeX RDF
16	Barry K. Rosen	Monoids for Rapid Data Flow Analysis.	POPL	1978	DBLP DOI BibTeX RDF
16	Mengjie Lv, Jianxi Fan, Baolei Cheng, Jia Yu 0005, Xiaohua Jia	Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks.	J. Parallel Distributed Comput.	2024	DBLP DOI BibTeX RDF
16	Konstantin Sidorov, Gonçalo Homem De Almeida Correia, Mathijs de Weerdt, Emir Demirovic	Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths.	AAAI	2024	DBLP DOI BibTeX RDF
16	Gökçe Çaylak Kayaturan, Gökhan Özçelik, Aytül Gökçe	Decision-aided evaluation of paths for routing on multi-attribute computer network consisting of encoded paths under uncertainty.	Expert Syst. Appl.	2023	DBLP DOI BibTeX RDF
16	Shiri Chechik, Tianyi Zhang 0008	Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths.	SODA	2023	DBLP DOI BibTeX RDF
16	Melissa D. Clarkson, Landon Detwiler	OWL Paths: A library for processing SPARQL-like property paths over OWL classes.	WOP@ISWC	2023	DBLP BibTeX RDF
16	Marie Destandau, Caroline Appert, Emmanuel Pietriga	S-Paths: Set-based visual exploration of linked data driven by semantic paths.	Semantic Web	2021	DBLP DOI BibTeX RDF
16	Alberto Bartoli	Robustness analysis of DNS paths and web access paths in public administration websites.	Comput. Commun.	2021	DBLP DOI BibTeX RDF
16	Yefim Dinitz, Shlomi Dolev, Manish Kumar 0011	Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths.	CoRR	2021	DBLP BibTeX RDF
16	Jia-Xiang Tang, Shih-Hsu Huang, Jui-Hung Hung	ECO Timing Optimization with Data Paths and Clock Paths Considered.	ISPACS	2021	DBLP DOI BibTeX RDF
16	Lin Yang, Sheng-Liang Yang	A Relation Between Schröder Paths and Motzkin Paths.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
16	Satoshi Naito, Fumihiko Nomoto, Daisuke Sagaki	Tensor product decomposition theorem for quantum Lakshmibai-Seshadri paths and standard monomial theory for semi-infinite Lakshmibai-Seshadri paths.	J. Comb. Theory, Ser. A	2020	DBLP DOI BibTeX RDF
16	Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt	No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.	J. Sched.	2019	DBLP DOI BibTeX RDF
16	Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan	Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles.	Bull. ICA	2018	DBLP BibTeX RDF
16	Koki Washio, Tsuneaki Kato	Filling Missing Paths: Modeling Co-occurrences of Word Pairs and Dependency Paths for Recognizing Lexical Semantic Relations.	CoRR	2018	DBLP BibTeX RDF
16	Koki Washio, Tsuneaki Kato	Filling Missing Paths: Modeling Co-occurrences of Word Pairs and Dependency Paths for Recognizing Lexical Semantic Relations.	NAACL-HLT	2018	DBLP DOI BibTeX RDF
16	Klaus Wehmuth, Artur Ziviani	Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks.	LADC	2018	DBLP DOI BibTeX RDF
16	Benjamin Momège	Simple Paths and Cycles Avoiding Forbidden Paths.	SOFSEM	2018	DBLP DOI BibTeX RDF
16	Susan Khor	Comparing local search paths with global search paths on protein residue networks: allosteric communication.	J. Complex Networks	2017	DBLP DOI BibTeX RDF
16	Jin Dai, Yebin Wang, Scott A. Bortoff, Daniel J. Burns	From reeds-shepp's paths to continuous curvature paths-Part I: Transition schemes & algorithms.	CCTA	2017	DBLP DOI BibTeX RDF
16	Keigo Matsumoto, Takuji Narumi, Yuki Ban, Tomohiro Tanikawa, Michitaka Hirose	Turn physically curved paths into virtual curved paths.	VR	2017	DBLP DOI BibTeX RDF
16	Romain Aïssat, Frédéric Voisin, Burkhart Wolff	Infeasible Paths Elimination by Symbolic Execution Techniques: Proof of Correctness and Preservation of Paths.	Arch. Formal Proofs	2016	DBLP BibTeX RDF
16	Sara Comai, Emanuele De Bernardi, Matteo Matteucci, Fabio Salice	Maps for Easy Paths (MEP): Enriching Maps with Accessible Paths Using MEP Traces.	GOODTECHS	2016	DBLP DOI BibTeX RDF
16	Romain Aïssat, Frédéric Voisin, Burkhart Wolff	Infeasible Paths Elimination by Symbolic Execution Techniques - Proof of Correctness and Preservation of Paths.	ITP	2016	DBLP DOI BibTeX RDF
16	Sarah Wassermann, Pedro Casas, Benoit Donnet, Guy Leduc, Marco Mellia	On the Analysis of Internet Paths with DisNETPerf, a Distributed Paths Performance Analyzer.	LCN Workshops	2016	DBLP DOI BibTeX RDF
16	Stefano Capparelli, Alberto Del Fra	Dyck Paths, Motzkin Paths, and the Binomial Transform.	J. Integer Seq.	2015	DBLP BibTeX RDF
16	Chia-Wei Lee, Pin-Liang Chen, Sun-Yuan Hsieh	Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
16	Rosena R. X. Du, Yingying Nie, Xuezhi Sun	Enumerations of humps and peaks in (k, a)-paths and (n, m)-Dyck paths via bijective proofs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
16	Shinsuke Odagiri, Hiroyuki Goto	On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2014	DBLP DOI BibTeX RDF
16	Tong-Wook Shinn, Tadao Takaoka	Combining the Shortest Paths and the Bottleneck Paths Problems.	ACSC	2014	DBLP BibTeX RDF
16	Tong-Wook Shinn, Tadao Takaoka	Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems.	LATIN	2014	DBLP DOI BibTeX RDF
16	Tong-Wook Shinn, Tadao Takaoka	Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems.	CoRR	2013	DBLP BibTeX RDF
16	Tong-Wook Shinn, Tadao Takaoka	Combining the Shortest Paths and the Bottleneck Paths Problems.	CoRR	2013	DBLP BibTeX RDF
16	Zbigniew R. Bogdanowicz	On Properties of Working Paths in Optimal Set of Survivable Paths.	Ars Comb.	2013	DBLP BibTeX RDF
16	Martin Charles Golumbic, Marina Lipshteyn, Michal Stern	Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid".	Networks	2013	DBLP DOI BibTeX RDF
16	Wen-Pin Tu, Shih-Hsu Huang, Chun-Hua Cheng	Co-synthesis of data paths and clock control paths for minimum-period clock gating.	DATE	2013	DBLP DOI BibTeX RDF
16	Dimitri Papadimitriou, Davide Careglio, Fabien Tarissan, Piet Demeester	Internet routing paths stability model and relation to forwarding paths.	DRCN	2013	DBLP BibTeX RDF
16	Liam Roditty, Uri Zwick	Replacement paths and k simple shortest paths in unweighted directed graphs.	ACM Trans. Algorithms	2012	DBLP DOI BibTeX RDF
16	Serge Gaspers	From edge-disjoint paths to independent paths	CoRR	2012	DBLP BibTeX RDF
16	Bixin Li, Lulu Wang 0001, Hareton Leung, Fei Liu 0019	Profiling all paths: A new profiling technique for both cyclic and acyclic paths.	J. Syst. Softw.	2012	DBLP DOI BibTeX RDF
16	Marcin Kaminski 0001, Paul Medvedev, Martin Milanic	Shortest paths between shortest paths.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
16	Salam N. Salloum, Lei Liu	Algorithms for Generating a Minimum Set of Paths for all Du-Paths Coverage.	SEDE	2011	DBLP BibTeX RDF
16	Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang	Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
16	Marcin Kaminski 0001, Paul Medvedev, Martin Milanic	Shortest paths between shortest paths and independent sets	CoRR	2010	DBLP BibTeX RDF
16	Aaron Bernstein	A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs.	SODA	2010	DBLP DOI BibTeX RDF
16	Marcin Kaminski 0001, Paul Medvedev, Martin Milanic	Shortest Paths between Shortest Paths and Independent Sets.	IWOCA	2010	DBLP DOI BibTeX RDF
16	Zvi Gotthilf, Moshe Lewenstein	Improved algorithms for the k simple shortest paths and the replacement paths problems.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
16	Shinji Inoue, Jun Shimaichi, Yoshiaki Kakuda	An autonomous method for aggregating primary paths and reserving backup paths in sensor networks.	ISADS	2009	DBLP DOI BibTeX RDF
16	Thomas Edison Yu, Tomokazu Yoneda, Satoshi Ohtake, Hideo Fujiwara	Identifying Non-Robust Untestable RTL Paths in Circuits with Multi-cycle Paths.	ATS	2008	DBLP DOI BibTeX RDF
16	C. C. Jane	A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance (Yeh, 2005).	J. Oper. Res. Soc.	2007	DBLP DOI BibTeX RDF
16	John Hogden, Philip Rubin, Erik McDermott, Shigeru Katagiri, Louis Goldstein	Inverting mappings from smooth paths through Rn to paths through Rm: A technique applied to recovering articulation from acoustics.	Speech Commun.	2007	DBLP DOI BibTeX RDF
16	Andreas Bley	Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths.	Networks	2007	DBLP DOI BibTeX RDF
16	Xingxing Yu	Infinite paths in planar graphs III, 1-way infinite paths.	J. Graph Theory	2006	DBLP DOI BibTeX RDF
16	Paul Dorbec, Michel Mollard	Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths.	Electron. J. Comb.	2005	DBLP DOI BibTeX RDF
16	W.-C. Yeh	A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance.	J. Oper. Res. Soc.	2005	DBLP DOI BibTeX RDF
16	Midori Kobayashi, Gisaku Nakamura, Chie Nara	Uniform coverings of 2-paths with 5-paths in the complete graph.	Discret. Math.	2005	DBLP DOI BibTeX RDF
16	Arthur W. Chou, Ker-I Ko	On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths.	CCA	2004	DBLP DOI BibTeX RDF
16	Arthur W. Chou, Ker-I Ko	On the complexity of finding paths in a two-dimensional domain I: Shortest paths.	Math. Log. Q.	2004	DBLP DOI BibTeX RDF
16	J. W. McGee, Christopher A. Rodger	Embedding coverings of 2-paths with 3-paths.	Discret. Math.	2004	DBLP DOI BibTeX RDF
16	Richard Brak, John W. Essam	Bicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice.	Electron. J. Comb.	2003	DBLP DOI BibTeX RDF
16	Midori Kobayashi, Gisaku Nakamura, Chie Nara	Uniform coverings of 2-paths with 5-paths in K2n.	Australas. J Comb.	2003	DBLP BibTeX RDF
16	Midori Kobayashi, Gisaku Nakamura	Uniform coverings of 2-paths by 4-paths.	Australas. J Comb.	2001	DBLP BibTeX RDF
16	Richard Furuta, Frank M. Shipman III, Luis Francisco-Revilla, Hao-wei Hsieh, Unmil Karadkar, Shueh-Cheng Hu	Ephemeral Paths on the WWW: The Walden's Paths Lightweight Path Mechanism.	WebNet	1999	DBLP BibTeX RDF
16	Andrei M. Shkel, Vladimir J. Lumelsky	On calculation of optimal paths with constrained curvature: the case of long paths.	ICRA	1996	DBLP DOI BibTeX RDF
16	Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi	A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations.	Ann. Oper. Res.	1995	DBLP DOI BibTeX RDF
16	Alexander V. Karzanov	Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths.	J. Comb. Theory, Ser. B	1994	DBLP DOI BibTeX RDF
16	Haruko Okamura	Paths and edge-connectivity in graphs III. Six-terminalk paths.	Graphs Comb.	1987	DBLP DOI BibTeX RDF
16	Mark E. Watkins	Infinite paths that contain only shortest paths.	J. Comb. Theory, Ser. B	1986	DBLP DOI BibTeX RDF
16	Rafic Z. Makki, C. Tiansheng	Designing Testable Control Paths with Multiple and Feedback Scan-Paths.	ITC	1986	DBLP BibTeX RDF
15	Francesc Castro, Esteve del Acebo, Mateu Sbert	Heuristic-Search-Based Light Positioning According to Irradiance Intervals.	Smart Graphics	2009	DBLP DOI BibTeX RDF	Light positioning, reuse of paths, random walk, heuristic search, irradiance
15	Aaron Bernstein, David R. Karger	A nearly optimal oracle for avoiding failed vertices and edges.	STOC	2009	DBLP DOI BibTeX RDF	shortest paths, sensitivity
15	Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe	Terracost: Computing least-cost-path surfaces for massive grid terrains.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	terrain data, shortest paths, Dijkstra's algorithm, I/O-efficiency, Data structures and algorithms
15	Nicolas Beldiceanu, Pierre Flener, Xavier Lorca	Combining Tree Partitioning, Precedence, and Incomparability Constraints.	Constraints An Int. J.	2008	DBLP DOI BibTeX RDF	Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem
15	Frank Kammer, Torsten Tholey	The Complexity of Minimum Convex Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF	Convex Coloring, Maximum Disjoint Paths Problem
15	Xiang Bai, Xingwei Yang, Longin Jan Latecki, Yanbo Xu, Wenyu Liu 0001	Computing Stable Skeletons with Particle Filters.	PRICAI	2008	DBLP DOI BibTeX RDF	skeletal paths, Skeleton, shape, particle filters, pruning
15	David Eppstein, Michael T. Goodrich	Studying (non-planar) road networks through an algorithmic lens.	GIS	2008	DBLP DOI BibTeX RDF	algorithmic lens, circle arrangements, disk neighborhood systems, multiscale-dispersed graphs, shortest paths, Voronoi diagrams, road networks
15	Jirí Vábek, Daniel Joscák, Milan Bohácek, Jirí Tuma	A New Type of 2-Block Collisions in MD5.	INDOCRYPT	2008	DBLP DOI BibTeX RDF	Stevens algorithm, collisions, MD5, differential paths
15	Saeedeh Bakhshi, Hamid Sarbazi-Azad	One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks.	ISPAN	2008	DBLP DOI BibTeX RDF	Multi-computers, WK-recursive, Parallel routing, interconnection networks, node-disjoint paths
15	Pavlo A. Krokhmal, Stan Uryasev	A sample-path approach to optimal position liquidation.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Optimal trading, Market impact, Stochastic programming, Sample paths
15	Hsiang-Yang Chen, Ting-Wei Hou, Chun-Liang Lin	Tamper-proofing basis path by using oblivious hashing on Java.	ACM SIGPLAN Notices	2007	DBLP DOI BibTeX RDF	basis paths, oblivious hashing, Java, Java, tamper-proofing
15	Smita Rai, Omkar Deshpande, Canhui Ou, Charles U. Martel, Biswanath Mukherjee	Reliable multipath provisioning for high-capacity backbone mesh networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	degraded service, effective multipath bandwidth, flexible provisioning, multiconstrained paths, multipath provisioning, virtual concatenation (VCAT)
15	Mohamed Shehab, Kamal Bhattacharya, Arif Ghafoor	Web services discovery in secure collaboration environments.	ACM Trans. Internet Techn.	2007	DBLP DOI BibTeX RDF	Secure collaboration, encapsulated SOAP, private UDDI registries, secure access paths, protocols, services
15	Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh	Hamiltonicity of hypercubes with a constraint of required and faulty edges.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Hamiltonian cycles and paths, Edge-fault-tolerance, Required edge, Hypercubes