Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Haikun Zhu, Yi Zhu 0002, Chung-Kuan Cheng, David M. Harris	An Interconnect-Centric Approach to Cyclic Shifter Design Using Fanout Splitting and Cell Order Optimization.	ASP-DAC	2007	DBLP DOI BibTeX RDF	64 bit, interconnect-centric approach, fanout splitting, cell order optimization, logarithmic cyclic shifter design, demultiplexers, shifting path, nonshifting paths, accumulated wire load, switching probabilities, integer linear programming
15	Matthias Müller-Hannemann, Karsten Weihe	On the cardinality of the Pareto set in bicriteria shortest path problems.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Pareto search, Railway networks, Shortest paths, Multi-criteria optimization
15	Hua-ming Xing, Liang Sun, Xue-Gang Chen	Domination in Graphs of Minimum Degree Five.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Domination number, Vertex disjoint paths cover, Upper bounds
15	Betsy George, Shashi Shekhar	Time-Aggregated Graphs for Modeling Spatio-temporal Networks.	ER (Workshops)	2006	DBLP DOI BibTeX RDF	Time-aggregated graphs, spatio-temporal data-bases, location based services, shortest paths
15	Stephen Hawk, Karen Crooker	Occupations and careers in computer networking and infrastructure management: implications for IS programs.	CPR	2006	DBLP DOI BibTeX RDF	networking, telecommunications, occupations, career paths
15	Huawei Li 0001, Xiaowei Li 0001	Selection of Crosstalk-Induced Faults in Enhanced Delay Test.	J. Electron. Test.	2005	DBLP DOI BibTeX RDF	automatic test pattern generation (ATPG), crosstalk, delay test, critical paths
15	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Multicommodity flow, well-linked terminals, and routing problems.	STOC	2005	DBLP DOI BibTeX RDF	all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths
15	Xiaodong Wu 0001	Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy.	COCOON	2005	DBLP DOI BibTeX RDF	Intensity map splitting, k-link shortest paths, Computational Medicine, Algorithms, IMRT
15	Jakob Krarup, Malene Nordlund Rørbech	LP formulations of the shortest path tree problem.	4OR	2004	DBLP DOI BibTeX RDF	visualizing LP-duality, linear programming, Shortest paths
15	Jan M. Hochstein, Karsten Weihe	Edge-disjoint routing in plane switch graphs in linear time.	J. ACM	2004	DBLP DOI BibTeX RDF	Planar graphs, edge-disjoint paths
15	Nicos Malevris	On structurally testing Java programs effectively.	PPPJ	2004	DBLP DOI BibTeX RDF	software testing, test data generation, structural testing, dynamic testing, infeasible paths
15	Refael Hassin, Shlomi Rubinstein	An Approximation Algorithm for Maximum Triangle Packing.	ESA	2004	DBLP DOI BibTeX RDF	maximum triangle packing, 2-edge paths, Analysis of algorithms
15	Yosuke Ito, Hiroshi Mineno, Susumu Ishihara	A Scheme Encouraging Mobile Nodes to Forward Packets via Multiple Wireless Links Aggregating System Between the Internet and Mobile Ad Hoc Networks.	OPODIS	2004	DBLP DOI BibTeX RDF	incentive of forwarding, SHAKE, ad hoc network, mobile computing, fairness, cooperation, mobile IP, accounting, multiple paths
15	Uriel Feige	On sums of independent random variables with unbounded variance, and estimating the average degree in a graph.	STOC	2004	DBLP DOI BibTeX RDF	shortest paths, inequalities
15	Pratik Dave, Paul Logasa Bogen II, Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III	Dynamically growing hypertext collections.	Hypertext	2004	DBLP DOI BibTeX RDF	hypertext collections, path-centric browsing, web site syndication, WWW, RSS, Walden's paths
15	Chunhong Zhang, Yuan Gao, Lixin Gao 0001	An Approach to Seeking Policy Disputes Based on Dispute Cycle Avoidance and Configuration Guideline.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	interdomain routing protocol, stable paths problem, route oscillations, dispute cycle, dispute routing policy, AS relationship
15	David Coudert, Hervé Rivano, Xavier Roche	A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.	WAOA	2003	DBLP DOI BibTeX RDF	combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths
15	Meinolf Sellmann	Cost-Based Filtering for Shorter Path Constraints.	CP	2003	DBLP DOI BibTeX RDF	optimization constraints, relaxed consistency, constrained shortest paths, problem reduction
15	Christopher A. Healy, David B. Whalley	Automatic Detection and Exploitation of Branch Constraints for Timing Analysis.	IEEE Trans. Software Eng.	2002	DBLP DOI BibTeX RDF	best-case execution time, branch constraints, Real-time systems, timing analysis, worst-case execution time, infeasible paths
15	Robert M. Hierons, T.-H. Kim, Hasan Ural	Expanding an Extended Finite State Machine to aid Testability.	COMPSAC	2002	DBLP DOI BibTeX RDF	testability, extended finite state machine, infeasible paths
15	Luis Francisco-Revilla, Frank M. Shipman III, Richard Furuta, Unmil Karadkar, Avital Arora	Perception of content, structure, and presentation changes in Web-based hypertext.	Hypertext	2001	DBLP DOI BibTeX RDF	managing fluid Web pages, meta-document, perception of change, Walden's paths, fluid documents
15	Akhil Kumar 0001	An Efficient SuperGrid Protocol for High Availability and Load Balancing.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	grid protocol, Crumbling Walls protocol, Paths system, load balancing, availability, quorum system, Server replication
15	Khaled Day, Abdel Elah Al-Ayyoub	Minimal Fault Diameter for Highly Resilient Product Networks.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter
15	Rainer Leupers, Steven Bashford	Graph-based code selection techniques for embedded processors.	ACM Trans. Design Autom. Electr. Syst.	2000	DBLP DOI BibTeX RDF	code selection, irregular data paths, embedded processors, data-flow graphs, SIMD instructions
15	Markus Lindgren, Hans Hansson, Henrik Thane	Using measurements to derive the worst-case execution time.	RTCSA	2000	DBLP DOI BibTeX RDF	execution time analysis, program flow analysis, low level timing information, low level timing analysis, program execution times, timing measurements, instrumented version, program fragments, non-exhaustive measurements, program paths, realistic processor model, scheduling, real-time systems, real time systems, embedded systems, worst-case execution time, pipeline processing, schedulability analysis, program diagnostics, architectural modeling, pipeline architectures, flow graphs, timing estimates, target architecture, system of linear equations
15	Jan Gustafsson	Eliminating annotations by automatic flow analysis of real-time programs.	RTCSA	2000	DBLP DOI BibTeX RDF	automatic flow analysis, path information, safe approximation, calculation cost, exact information, intractable problem, nontrivial programs, real-time systems, annotations, abstract interpretation, worst case execution time, WCET, automatic programming, program diagnostics, real time programs, infeasible paths
15	Gundolf Kiefer, Hans-Joachim Wunderlich	Deterministic BIST with Multiple Scan Chains.	J. Electron. Test.	1999	DBLP DOI BibTeX RDF	deterministic scan-based BIST, multiple scan paths, parallel scan
15	Karsten Weihe	Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.	FOCS	1999	DBLP DOI BibTeX RDF	Graph algorithms, planar graphs, disjoint paths
15	Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski	On Routing in Circulant Graphs.	COCOON	1999	DBLP DOI BibTeX RDF	Shortest paths, Lattices, Diameter, Loops, Circulant graphs
15	Asmus Hetzel	A Sequential Detailed Router for Huge Grid Graphs.	DATE	1998	DBLP DOI BibTeX RDF	Rip-up And Reroute, Shortest Paths, Detailed Routing
15	Gundolf Kiefer, Hans-Joachim Wunderlich	Deterministic BIST with multiple scan chains.	ITC	1998	DBLP DOI BibTeX RDF	deterministic scan-based BIST, multiple scan paths, parallel scan
15	Sabine Stifter	Optimal Collision Free Path Planning for Non-Synchronized Motions.	J. Intell. Robotic Syst.	1997	DBLP DOI BibTeX RDF	cell decomposition, weighted regions, non-synchronized motions, optimal paths, robot path planning
15	Khaled Day, Abdel Elah Al-Ayyoub	The Cross Product of Interconnection Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	parallel paths, routing, interconnection networks, Broadcasting, embedding, product networks
15	Horng-Ren Tsai, Shi-Jinn Horng, Shun-Shan Tsai, Tzong-Wann Kao, Shung-Shing Lee	Solving an Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Hyper-bus broadcast network, matrix multiplication operation, minimum-weight spanning tree, parallel algorithm, graph theory, connectivity, transitive closure, connected component, bridge, biconnected component, all-pair shortest paths, articulation point, algebraic path problem
15	Richard Kunze, Franz-Erich Wolter, Thomas Rausch	Geodesic Voronoi Diagrams on Parametric Surfaces.	Computer Graphics International	1997	DBLP DOI BibTeX RDF	geodesic Voronoi diagrams, parameterized surfaces, surface paths, computational geometry, parametric surfaces
15	Karen Panetta Lentz, Elias S. Manolakos, Edward C. Czeck	A multiple domain environment for efficient simulation.	Annual Simulation Symposium	1997	DBLP DOI BibTeX RDF	multiple domain environment, efficient simulation, concurrent simulation methodology, digital logic experimentation, multiple experiment environment, independent experiments, parallel hardware, digital logic simulators, signature paths, multiple experiment algorithms, function list, dynamic interactions, exhaustive simulation problem, Multiple Stuck-at Fault simulations, logic CAD, coverage analysis, digital logic
15	Barbara C. Davis, Tatu Ylönen	Working Group Report on Internet/Intranet Security.	WETICE	1997	DBLP DOI BibTeX RDF	intranet security, key backup, security implementation costs, security functionality, fault tolerance, Internet, enterprises, secure communications, Internet security, data protection, information infrastructure, key recovery, key escrow, law enforcement, redundant paths, data value
15	Hausi A. Müller, Kenny Wong, Margaret-Anne D. Storey	Wrapping coarse-grained objects using standard infrastructure technology.	ICSM	1997	DBLP DOI BibTeX RDF	coarse-grained object wrapping, standard infrastructure technology, subsystem migration, system reengineering, communication paths, reverse engineering, software maintenance, CORBA, Common Object Request Broker Architecture, object-oriented methods, legacy systems, client server
15	Takeo Hamada, Stephanie Hogg, Jarno Rajahalme, Carlo Licciardi, Lill Kristiansen, Per Fly Hansen	Service quality in TINA-quality of service trading in open network architecture.	EDOC	1997	DBLP DOI BibTeX RDF	TINA service architecture, quality of service trading, open network architecture, enterprise level QoS issues, QoS evolution paths, TINA stream binding, soft stream quality guarantee, progressive service quality evolution, open systems, resource reservation, service quality
15	Po-Jen Chuang	CGIN: A Fault Tolerant Modified Gamma Interconnection Network.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Gamma interconnection networks, fault tolerance, routing algorithms, Disjoint paths, terminal reliability
15	Ge-Ming Chiu, Kai-Shung Chen	Fault-tolerant routing strategy using routing capability in hypercube multicomputers.	ICPADS	1996	DBLP DOI BibTeX RDF	fault-tolerant routing strategy, routing capability, feasible minimum paths, fault tolerant computing, message passing, hypercube networks, upper bound, network routing, message routing, link failures, shortest path routing, hypercube multicomputers, faulty hypercube
15	Ragunathan Rajkumar, Michael Gagliardi	High availability in the real-time publisher/subscriber inter-process communication model.	RTSS	1996	DBLP DOI BibTeX RDF	real time publisher/subscriber communications model, interprocess communication model, rejoins, repetitive real time processes, RT P/S model, processor membership protocol layer, periodic broadcast membership protocol, strong semantics, idempotence properties, weak interleaving needs, communication programming interface, steady state real time execution paths, multimedia dissemination applications, fault tolerant computing, distributed processing, feedback control, distributed real time systems, node failures, processor failures
15	Martina Marré, Antonia Bertolino	Reducing and Estimating the Cost of Test Coverage Criteria.	ICSE	1996	DBLP BibTeX RDF	generalised algorithm, minimum entity set, program flowgraph entities, spanning set, test coverage criteria cost estimation, test coverage criteria cost reduction, test paths, program testing, software cost estimation, flowcharting
15	Keerthi Heragu, Janak H. Patel, Vishwani D. Agrawal	Improving accuracy in path delay fault coverage estimation.	VLSI Design	1996	DBLP DOI BibTeX RDF	fault coverage estimation, simulated vector pair, exact fault simulation, fixed-length path-segments, fan-in branches, fan-out branches, flagged path-segments, segment lengths, combinational paths, graph theory, fault diagnosis, logic testing, delays, combinational circuits, logic CAD, circuit analysis computing, path delay fault, approximate methods, CPU time
15	Kees van Berkel 0001, Ferry Huberts, Ad M. G. Peeters	Stretching quasi delay insensitivity by means of extended isochronic forks.	ASYNC	1995	DBLP DOI BibTeX RDF	extended isochronic forks, isochronic-fork assumption, double-rail data paths, DCC error decoder, logic design, asynchronous circuits, asynchronous circuits, arbiter, delay insensitivity, handshake circuits
15	Michel Renovell, Florence Azaïs, Yves Bertrand	A design-for-test technique for multistage analog circuits.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	design-for-test technique, multistage analog circuits, DFT approach, op-amp-based modules, testability resources, transparent paths, external I/O, local I/O, test mode, on-chip digital resources, analog response penalty, controllability, controllability, integrated circuit testing, design for testability, observability, observability, mixed-signal circuits, mixed analogue-digital integrated circuits, test management, production testing
15	Sandeep Pagey, Ajay Khoche, Erik Brunvand	DFT for fast testing of self-timed control circuits.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	fast testing, self-timed control circuits, execution paths, simultaneous testing, OCCAM based circuit compiler, OCCAM program, self-timed macro-modules, modified modules, macromodules, fault diagnosis, logic testing, delays, design for testability, DFT, logic CAD, asynchronous circuits, translation, program compilers, automatic test software
15	Patrick Schaumont, Bart Vanthournout, Ivo Bolsens, Hugo De Man	Synthesis of pipelined DSP accelerators with dynamic scheduling.	ISSS	1995	DBLP DOI BibTeX RDF	DSP algorithms, FFT butterfly accelerator block, application specific DSP accelerators, highly pipelined data paths, pipelined DSP accelerator synthesis, pipelined bit-parallel hardware, silicon, scheduling, parallel architectures, application specific integrated circuits, dynamic scheduling, pipeline processing, circuit CAD, digital signal processing chips, datapath, controller architecture, network synthesis, run-time schedules
15	Enric Musoll, Jordi Cortadella	Scheduling and resource binding for low power.	ISSS	1995	DBLP DOI BibTeX RDF	data-path power budget, low-power data-paths, scheduling, low power, high level synthesis, high-level synthesis, power consumption, adders, multipliers, logic circuits, data flow graphs, trading off, network synthesis, functional units, resource binding, resource-binding
15	Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman	Automatic Generation of Triangular Irregular Networks Using Greedy Cuts.	IEEE Visualization	1995	DBLP DOI BibTeX RDF	triangular irregular networks, dense terrain models, greedy cuts, minimum-link paths, closed polygon, ear cutting, greedy biting, edge splitting, structural terrain fidelity, input height array, graph theory, triangulation, data visualisation, mesh generation, running time, automatic generation, memory requirements
15	Jose Roberto Fernandez, Matt W. Mutka	A Burst-Oriented Traffic Control Framework for ATM Networks.	ICCCN	1995	DBLP DOI BibTeX RDF	burst-oriented traffic control, eager transmission, Erlang loss system, ATM networks, call admission control, bursty traffic, bandwidth reservation, virtual paths
15	Robert J. Carragher, Masahiro Fujita, Chung-Kuan Cheng	Simple tree-construction heuristics for the fanout problem .	ICCD	1995	DBLP DOI BibTeX RDF	tree-construction heuristics, fanout problem, fanout delay, buffer fanout trees, technology mapped network, gate-transformation, LT-tree construction technique, delays, combinational circuits, trees (mathematics), critical paths, logical functions
15	Ajay J. Daga, William P. Birmingham	A symbolic-simulation approach to the timing verification of interacting FSMs.	ICCD	1995	DBLP DOI BibTeX RDF	symbolic-simulation approach, interacting FSMs, timing verifier, complex sequential circuit verification, combinational paths, inherently modular nature, symbolic simulation verification methodology, formal verification, logic testing, finite state machines, finite state machines, sequential circuits, circuit analysis computing, timing verification
15	Dimitrios Karayiannis, Spyros Tragoudas	Uniform area timing-driven circuit implementation.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	circuit module, cell library, input-output paths, overall area, timing-driven circuit implementation, computational complexity, heuristics, CAD, delays, timing, sequential circuits, sequential circuits, NP-hard, directed graphs, combinational circuits, combinational circuits, logic CAD, polynomial time algorithm, directed acyclic graphs, circuit CAD, cellular arrays, propagation delay
15	Anand Raghunathan, Pranav Ashar, Sharad Malik	Test generation for cyclic combinational circuits.	VLSI Design	1995	DBLP DOI BibTeX RDF	cyclic combinational circuits, bus structures, single-stuck-at fault test pattern, test generation problem, program RAM, fault diagnosis, logic testing, integrated circuit testing, network topology, combinational circuits, automatic testing, fault coverage, test pattern generators, formal analysis, data paths, testing algorithm, combinational logic circuits, untestable faults
15	Dinesh Bhatia, James Haralambides	Resource requirements for field programmable interconnection chips.	VLSI Design	1995	DBLP DOI BibTeX RDF	field programmable interconnection chips, n-permutation graph, network property, routing delays, programmable switches, routing paths, specific I/O permutations, user-configured interconnection, VLSI, VLSI, graph theory, network routing, permutation networks, integrated circuit interconnections, Benes network
15	Dick Jensen	Adventures in Embedded Development.	IEEE Softw.	1994	DBLP DOI BibTeX RDF	embedded systems development, software tool selection, off-the-shelf real-time operating system, unplanned critical paths, development delays, timing demands, software engineering, real-time systems, software tools, costs, operating systems (computers), project planning, protocol stacks, commercial products
15	J. C. Huang 0001	State Constraints and Pathwise Decomposition of Programs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	state constraint, program pathwise, subprograms, execution paths, formal basis, pathwise decomposition, software engineering, computational complexity, verification, testing, program testing, control flow, programming construct, program simplification
15	Edward Omiecinski	Heuristics for Join Processing Using Nonclustered Indexes.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	nonclustered indexes, bipartite graph model, page accesses, database environment, relational databases, relational databases, relations, buffer size, tuples, join processing, query optimisation, access paths
15	Raphael A. Finkel, Michael L. Scott, Yeshayahu Artsy, Hung-Yang Chang	Experience with Charlotte: Simplicity and Function in a Distributed Operating System.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	Charlotte distributed operating system, computation-intensive problems, large-grain parallelism, Crystal multicomputer, VAX-11/750 computers, kernel/process interface, bidirectional communication paths, synchronous nonblocking communications, multitask kernel, absolute distributed information, high-level tools, Lynx distributed programming language, kernal primitives, concurrency, abstraction, finite-state machines, local area network, local area networks, operating systems (computers), software packages, multiprocessing programs, computer communications software
15	Ben J. H. Verwer, Piet W. Verbeek, Simon T. Dekker	An Efficient Uniform Cost Algorithm Applied to Distance Transforms.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	uniform cost propagation, uniform cost algorithm, pattern recognition, graph theory, picture processing, picture processing, optimisation, shortest paths, distance transforms, pixel, bucket sort
15	Keinosuke Fukunaga, Raymond R. Hayes	The Reduced Parzen Classifier.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	uniform cost propagation, uniform cost algorithm, pattern recognition, graph theory, picture processing, picture processing, optimisation, shortest paths, distance transforms, pixel, bucket sort
15	Rangachar Kasturi, Juan Alemany	Information Extraction of Paper-Based Maps.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	paper-based maps, spatial features, image-analysis algorithms, closed contours, map images, query processor, information retrieval, user interfaces, Fortran, database management systems, query languages, shortest paths, Lisp, distances, syntax, cartography, geographic data
15	Vincenzo Ambriola, David Notkin	Reasoning About Interactive Systems.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	command decomposition, component decomposition, action paths, unconstrained actions, error profile, user interfaces, interactive system, interactive systems
15	Anhua Lin	On a special class of regularized central paths for semidefinite programs.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 49M29, 90C22, 90C51, 90C46
15	Hao Wen, Zhengfu Han, Yibo Zhao, Guangcan Guo, Peilin Hong	Multiple stochastic paths scheme on partially-trusted relay quantum key distribution network.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	quantum network, trusted relay, security, stochastic, quantum key distribution
15	Gang George Yin, Cristina Ion, Vikram Krishnamurthy	How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 62L20, 60J10, 34E05, 90C15
15	Mukund Balasubramanian, Jonathan R. Polimeni, Eric L. Schwartz	Exact Geodesics and Shortest Paths on Polyhedral Surfaces.	IEEE Trans. Pattern Anal. Mach. Intell.	2009	DBLP DOI BibTeX RDF
15	Monica Hernandez, Matías N. Bossa, Salvador Olmos	Registration of Anatomical Images Using Paths of Diffeomorphisms Parameterized with Stationary Vector Field Flows.	Int. J. Comput. Vis.	2009	DBLP DOI BibTeX RDF	LDDMM, Diffeomorphic registration, Infinite dimensional, Stationary parameterization, Efficient, Riemannian manifold, Computational Anatomy
15	Jieh-Shan Yeh, Ying-Lin Lin, Yu-Cheng Chen	Mining Preferred Traversal Paths with HITS.	WISM	2009	DBLP DOI BibTeX RDF	Preferred navigation patterns, Web usage mining, Preference, Web structure mining, HITS algorithm
15	Armando Alves Neto, Mario Fernando Montenegro Campos	On the generation of feasible paths for aerial robots with limited climb angle.	ICRA	2009	DBLP DOI BibTeX RDF
15	Ran Duan, Seth Pettie	Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths.	SODA	2009	DBLP DOI BibTeX RDF
15	Sandeep Sen	Approximating Shortest Paths in Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo	Kernel Bounds for Disjoint Cycles and Disjoint Paths.	ESA	2009	DBLP DOI BibTeX RDF
15	Gregory Z. Gutin, Eun Jung Kim 0002	Properly Coloured Cycles and Paths: Results and Open Problems.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
15	Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack	Shortest paths in time-dependent FIFO networks using edge load forecasts.	GIS-IWCTS	2009	DBLP DOI BibTeX RDF
15	Pechin Lo, Jon Sporring, Jesper Johannes Holst Pedersen, Marleen de Bruijne	Airway Tree Extraction with Locally Optimal Paths.	MICCAI (1)	2009	DBLP DOI BibTeX RDF
15	Chandra Chekuri, Alina Ene, Nitish Korula	Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
15	April K. Andreas, J. Cole Smith, Simge Küçükyavuz	Branch-and-price-and-cut algorithms for solving the reliable h -paths problem.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Branch-and-price-and-cut, Reliability, Network optimization, Nonconvex optimization
15	Eric Angel, Evripidis Bampis, Fanny Pascual	The impact of local policies on the quality of packet routing in paths, trees, and rings.	J. Sched.	2008	DBLP DOI BibTeX RDF	Approximation with performance guarantee, Price of anarchy, Packet routing, Scheduling policies
15	Yevgeny Schreiber, Micha Sharir	An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map
15	Fabio Antonacci, Marco Foco, Augusto Sarti, Stefano Tubaro	Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup.	IEEE Trans. Speech Audio Process.	2008	DBLP DOI BibTeX RDF
15	Hong Li, Lorne Mason, Michael G. Rabbat	Learning Minimum Delay Paths in Service Overlay Networks.	NCA	2008	DBLP DOI BibTeX RDF	distributed minimum delay routing, Learning automata
15	Oliver Wienand, Markus Wedler, Dominik Stoffel, Wolfgang Kunz, Gert-Martin Greuel	An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths.	CAV	2008	DBLP DOI BibTeX RDF
15	Yoav Gabriely, Elon Rimon	C-space characterization of contact preserving paths with application to tactile-sensor based mobile robot navigation.	ICRA	2008	DBLP DOI BibTeX RDF
15	Rosanna Leung, Rob Law 0001	Analyzing a Hotel Website's Access Paths.	ENTER	2008	DBLP DOI BibTeX RDF	hotel websites, customer behaviour, log file analysis, access path
15	Fernando Barreto, Emílio C. G. Wille, Luiz Nacamura	Fast recovery paths schema to improve reliability in IP networks.	NOMS	2008	DBLP DOI BibTeX RDF
15	Ricardo G. Sanfelice, Emilio Frazzoli	On the Optimality of Dubins Paths across Heterogeneous Terrain.	HSCC	2008	DBLP DOI BibTeX RDF
15	Ash Mohammad Abbas	Scalability and Route Failure Time of a Hybrid Protocol for Identification of Node-Disjoint Paths in Mobile Ad Hoc Networks.	ICDCIT	2008	DBLP DOI BibTeX RDF
15	Takashi Kanai, Yutaka Ohtake	Discrete shortest paths on smooth surface representations.	Shape Modeling International	2008	DBLP DOI BibTeX RDF
15	Ke Qiu 0001	An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube.	ICPADS	2008	DBLP DOI BibTeX RDF
15	Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwan Krunz	SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths.	INFOCOM	2008	DBLP DOI BibTeX RDF
15	Khurram Waheed, Robert Bogdan Staszewski, Sameh Rezeq	Curse of digital polar transmission: Precise delay alignment in amplitude and phase modulation paths.	ISCAS	2008	DBLP DOI BibTeX RDF
15	Daniel Iparraguirre-Cardenas, Jose Luis Garcia-Gervacio, Víctor H. Champac	A design methodology for logic paths tolerant to local intra-die variations.	ISCAS	2008	DBLP DOI BibTeX RDF
15	Jizan Zhang	Congestion Avoidance and Control Mechanism for Multi-paths Routing in WSN.	CSSE (5)	2008	DBLP DOI BibTeX RDF
15	Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer	Discovery of Network Properties with All-Shortest-Paths Queries.	SIROCCO	2008	DBLP DOI BibTeX RDF
15	Keiichi Kaneko, Shietung Peng	Node-to-Set Disjoint Paths Routing in Dual-Cube.	ISPAN	2008	DBLP DOI BibTeX RDF	node-to-set routing, dual-cube, algorithm, interconnection network
15	Huaikou Miao, Zhong-sheng Qian, Bo Song	Towards Automatically Generating Test Paths for Web Application Testing.	TASE	2008	DBLP DOI BibTeX RDF
15	Gyula Pap	Packing Non-Returning A-Paths.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C70, 05C40
15	Jianxi Fan, Xiaohua Jia, Xiaola Lin	Optimal Embeddings of Paths with Various Lengths in Twisted Cubes.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	edge-pancyclicity, interconnection network, embedding, dilation, path, Twisted cube