Search results for "Ford"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
88	Xue Zhang 0001, Jue Hong, Sanglu Lu, Li Xie 0001, Jiannong Cao 0001	Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	Bellman-Ford, void (hole), wireless sensor network, scalability, geographic routing
61	Lori Anschuetz, Stephanie Rosenbaum	Ethnographic interviews guide design of ford vehicles website.	CHI Extended Abstracts	2003	DBLP DOI BibTeX RDF	ethnographic interviews, ethnography, field studies, contextual inquiry, website design
54	Hideki Tode, Zhu Tianwei, Shouhei Nishi, Koso Murakami	A Route Design Algorithm for Multiple-Encoding Optical CDM Switching Network.	LCN	2000	DBLP DOI BibTeX RDF	light interference, photonic switching systems, route design algorithm, multiple-encoding optical CDM switching network, photonic IP switching system, routing information, interference noise, restrict-complied routing method, Bellman-Ford algorithm, Internet, transport protocols, encoding, network topologies, telecommunication network routing, optical fibre networks, next generation Internet
53	Brian C. Dean, Michel X. Goemans, Nicole Immorlica	Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data.	ESA	2006	DBLP DOI BibTeX RDF
49	Mohammad Baharloo, Reza Hajisheykhi, Mohammad Arjomand, Amir-Hossein Jahangir	An Analytical Performance Evaluation for WSNs Using Loop-Free Bellman Ford Protocol.	AINA	2009	DBLP DOI BibTeX RDF	Analytical mode, Loop-Free Bellman Ford Protocol, Wireless Sensor Network, Queuing system
48	Muhammad Baqar Raza, Tom Kirkham, Robert Harrison, Quentin Reul	Improving manufacturing efficiency at ford using product centred knowledge management.	ICDIM	2009	DBLP DOI BibTeX RDF
48	Simon J. E. Taylor, Leif Bohli, Xiaoguang Wang 0002, Stephen John Turner	Investigating Distributed Simulation at The Ford Motor Company.	DS-RT	2005	DBLP DOI BibTeX RDF
48	Colin B. Burke	The Ford Foundation's Search for an American Library Laboratory.	IEEE Ann. Hist. Comput.	2002	DBLP DOI BibTeX RDF
48	John Ladbrook, Annette Januszczak	Ford's power train operations: changing the simulation environment.	WSC	2001	DBLP DOI BibTeX RDF
48	C. Cheng, R. Riley, Srikanta P. R. Kumar, J. J. Garcia-Luna-Aceves	A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect.	SIGCOMM	1989	DBLP DOI BibTeX RDF
39	Maren Martens, S. Thomas McCormick	A Polynomial Algorithm for Weighted Abstract Flow.	IPCO	2008	DBLP DOI BibTeX RDF
39	Michael Cavaretta	Data mining challenges in the automotive domain.	KDD	2006	DBLP DOI BibTeX RDF
39	Daniel Sawitzki	Experimental Studies of Symbolic Shortest-Path Algorithms.	WEA	2004	DBLP DOI BibTeX RDF
38	Dean Wampler, Tony Clark 0001, Neal Ford, Brian Goetz	Multiparadigm Programming in Industry: A Discussion with Neal Ford and Brian Goetz.	IEEE Softw.	2010	DBLP DOI BibTeX RDF
35	Nestor Rychtyckyj	Intelligent Systems for Manufacturing at Ford Motor Company.	IEEE Intell. Syst.	2007	DBLP DOI BibTeX RDF	standard language, assembly plants, machine translation, manufacturing, ergonomics, controlled language
35	Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Lim	Statistical Bellman-Ford algorithm with an application to retiming.	ASP-DAC	2006	DBLP DOI BibTeX RDF
35	Nestor Rychtyckyj	An Assessment of Machine Translation for Vehicle Assembly Process Planning at Ford Motor Company.	AMTA	2002	DBLP DOI BibTeX RDF
35	A. S. Nepomniaschaya	An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs.	PaCT	2001	DBLP DOI BibTeX RDF
34	Thomas Ford, David Long, Echo Ford	Imparting Systems Engineering Experience via Interactive Fiction Serious Games.	Int. J. Serious Games	2023	DBLP DOI BibTeX RDF
34	Jeff Ford, Jordan Ford	Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences.	ICRA	2023	DBLP DOI BibTeX RDF
34	Jeff Ford, Jordan Ford	Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences.	CoRR	2022	DBLP DOI BibTeX RDF
34	James D. Ford, Simon E. Tilleard, Lea Berrang-Ford, Malcolm Araos, Robbert Biesbroek, Alexandra C. Lesnikowski, Graham K. MacDonald, Angel Hsu, Chen Chen, Livia Bizikova	Opinion: Big data has big potential for applications to climate change adaptation.	Proc. Natl. Acad. Sci. USA	2016	DBLP DOI BibTeX RDF
34	Jessica L. Ford, Keri K. Stephens, Jacob S. Ford	Digital Restrictions at Work: Exploring How Selectively Exclusive Policies Affect Crisis Communication.	Int. J. Inf. Syst. Crisis Response Manag.	2014	DBLP DOI BibTeX RDF
34	Timothy R. Huerta, Mark A. Thompson, Eric W. Ford, William F. Ford	Electronic health record implementation and hospitals' total factor productivity.	Decis. Support Syst.	2013	DBLP DOI BibTeX RDF
34	Timothy R. Huerta, Mark A. Thompson, Eric W. Ford, William F. Ford	Implementing electronic lab order entry management in hospitals: Incremental strategies lead to better productivity outcomes.	Int. J. Inf. Manag.	2013	DBLP DOI BibTeX RDF
34	Shelia R. Cotten, George Ford, Sherry Ford, Timothy M. Hale	Internet use and depression among older adults.	Comput. Hum. Behav.	2012	DBLP DOI BibTeX RDF
34	Timothy R. B. Taylor, David N. Ford, Andrew Ford	Improving model understanding using statistical screening.	WSC	2010	DBLP DOI BibTeX RDF
34	Christopher T. H. Baker, Judith M. Ford, Neville J. Ford	Bifurcations in Approximate Solutions of Stochastic Delay Differential Equations.	Int. J. Bifurc. Chaos	2004	DBLP DOI BibTeX RDF
34	Judith M. Ford, Ke Chen 0002, Neville J. Ford	Flexible parallelization of fast wavelet transforms.	Parallel Algorithms Appl.	2003	DBLP DOI BibTeX RDF
34	Nigel Ford, Rosalind Ford	Toward a Cognitive Theory of Information Accessing: An Empirical Study.	Inf. Process. Manag.	1993	DBLP DOI BibTeX RDF
34	Neville J. Ford, Judith M. Ford	Introducing formal methods - a less mathematical approach.		1993	RDF
34	Nigel Ford, Rosalind Ford	Learning strategies in an 'ideal' computer-based learning environment.	Br. J. Educ. Technol.	1992	DBLP DOI BibTeX RDF
27	Piotr Dziurzanski, Tomasz Maka	Stream Transfer Balancing Scheme Utilizing Multi-Path Routing in Networks on Chip.	ARC	2008	DBLP DOI BibTeX RDF	stream-based processing, tapeworm routing, Ford-Fulkerson method, Networks on Chip, wormhole routing
27	Marcin Peczarski	New Results in Minimum-Comparison Sorting.	Algorithmica	2004	DBLP DOI BibTeX RDF	Optimal sorting, The Ford-Johnson algorithm, Counting linear extensions
27	Gururaj S. Rao, Harold S. Stone, T. C. Hu	Assignment of Task in a Distributed Processor System with Limited Memory.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	Ford?Fulkerson algorithm, Gomory?Hu cut trees, multiterminal maximal flows, load balancing, distributed computers, Computer networks, NP-complete problems, cutsets
26	Muhammad Baqar Raza, Tom Kirkham, Robert Harrison, Radmehr P. Monfared, Izhar Ul Haq, Stuart Wood	Evolving knowledge based product lifecycle management from a digital ecosystem to support automated manufacturing.	MEDES	2009	DBLP DOI BibTeX RDF	product lifecycle, ontologies, World Wide Web (WWW), semantic web, knowledge management, automation, manufacturing
26	Elizabeth Baron	Successes and Challenges on Using VR in Product Design and Engineering.	VR	2009	DBLP DOI BibTeX RDF
26	Ângela Vilhena Dias, Sérgio Shiguemi Furuie	Multiframe estimation of contour evolution in medical images.	ISBI	2008	DBLP DOI BibTeX RDF
26	V. Krishna Nandivada, Fernando Magno Quintão Pereira, Jens Palsberg	A Framework for End-to-End Verification and Evaluation of Register Allocators.	SAS	2007	DBLP DOI BibTeX RDF
26	Zehang Sun, George Bebis, Ronald Miller	Monocular Precrash Vehicle Detection: Features and Classifiers.	IEEE Trans. Image Process.	2006	DBLP DOI BibTeX RDF
26	Chi-Him Wong, Yiu-Cheong Tam	Negative Cycle Detection Problem.	ESA	2005	DBLP DOI BibTeX RDF
26	Nestor Rychtyckyj	Maintenance Issues for Machine Translation Systems.	AMTA	2004	DBLP DOI BibTeX RDF
26	Paul Frenger	Forth report: strap-on Forth.	ACM SIGPLAN Notices	2002	DBLP DOI BibTeX RDF
26	David C. Conner, Prasad N. Atkar, Alfred A. Rizzi, Howie Choset	Experimental Verification of Deposition Models for Automotive Painting with Electrostatic Rotating Bell Atomizers.	ISER	2002	DBLP DOI BibTeX RDF
26	Goran Konjevod, Soohyun Oh, Andréa W. Richa	Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.	LATIN	2002	DBLP DOI BibTeX RDF
26	Wen-Lin Yang	Solving the MCOP Problem Optimally.	LCN	2002	DBLP DOI BibTeX RDF
26	Nitin Chandrachoodan, Shuvra S. Bhattacharyya, K. J. Ray Liu	Adaptive negative cycle detection in dynamic graphs.	ISCAS (5)	2001	DBLP DOI BibTeX RDF
26	Steve Sims, Rance Cleaveland, Ken Butts, Scott Ranville	Automated Validation of Software Models.	ASE	2001	DBLP DOI BibTeX RDF
26	Gianni Di Caro, Marco Dorigo	Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks.	PPSN	1998	DBLP DOI BibTeX RDF
26	Susana Stoica	A lifecycle approach to design validation is it necessary? Is it feasible?	ITC	1998	DBLP DOI BibTeX RDF	Lifecycle test, system approach to design and test, Robust Test Methodology (RTM), Design Validation (DV), software /hardware test methods, requirements specifications test, QA-type testing, Test Plan (TP) boilerplate, test optimization considering full lifecycle DV, black box testing, white box testing
26	Robert B. Johnston, Ruby Po Wan Lee	The Role of Electronic Commerce Technologies in Just-In-Time Replenishment.	HICSS (4)	1997	DBLP DOI BibTeX RDF
26	Charles E. Perkins, Pravin Bhagwat	Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers.	SIGCOMM	1994	DBLP DOI BibTeX RDF
26	Neff Walker, John B. Smelcer	A comparison of selection time from walking and pull-down menus.	CHI	1990	DBLP DOI BibTeX RDF
26	Terry Winograd	What can we teach about human-computer interaction? (plenary address).	CHI	1990	DBLP DOI BibTeX RDF
26	Hans Brunner	A snapshot of natural language interfaces (panel).	CHI	1990	DBLP DOI BibTeX RDF
26	Jakob Nielsen	Designing for international use (panel).	CHI	1990	DBLP DOI BibTeX RDF
26	S. Joy Mountford	Designers: meet your users (panel).	CHI	1990	DBLP DOI BibTeX RDF	Apple Computer, HyperCard, Inc
26	Marcy Telles	Updating an older interface.	CHI	1990	DBLP DOI BibTeX RDF	WordStar
26	Glenn K. Manacher, Tien Dai Bui, Mai Thanh	Optimum combinations of sorting and merging.	J. ACM	1989	DBLP DOI BibTeX RDF
26	Bala Rajagopalan, Michael Faiman	A New Responsive Distributed Shortest-Path Rounting Algorithm.	SIGCOMM	1989	DBLP DOI BibTeX RDF
21	Bimbisar Irom	Between remediating and participating: visuals of the Ford-Kavanaugh controversy on Instagram.	Online Inf. Rev.	2024	DBLP DOI BibTeX RDF
21	Jialu Hu, László Kozma 0002	Non-adaptive Bellman-Ford: Yen's improvement is optimal.	CoRR	2024	DBLP DOI BibTeX RDF
21	Sam Taggart	M. Scott Ford on Managing Dependency Freshness.	IEEE Softw.	2024	DBLP DOI BibTeX RDF
21	Spyridon Drakakis, Constantine Kotropoulos	Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem.	ICPRAM	2024	DBLP DOI BibTeX RDF
21	Shishir Singh Chauhan, Dilip Kumar	Mode Search Optimization Algorithm for Traffic Prediction and Signal Controlling Using Bellman-Ford with TPFN Path Discovery Model Based on Deep LSTM Classifier.	SN Comput. Sci.	2023	DBLP DOI BibTeX RDF
21	Olga Timofeeva, Alexey Sannikov, Maria Stepanenko, Tatiana Balashova	Modification of the Bellman-Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures.	Comput.	2023	DBLP DOI BibTeX RDF
21	Sami Davies, Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang	Predictive Flows for Faster Ford-Fulkerson.	CoRR	2023	DBLP DOI BibTeX RDF
21	Pallapothala Tejaswini, Rajesh Doriya, Kaushlendra Sharma	Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm.	ICISS	2023	DBLP DOI BibTeX RDF
21	Tomasz Kociumaka, Adam Polak 0001	Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths.	ESA	2023	DBLP DOI BibTeX RDF
21	Sami Davies, Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang	Predictive Flows for Faster Ford-Fulkerson.	ICML	2023	DBLP BibTeX RDF
21	Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii	Speeding Up Bellman Ford via Minimum Violation Permutations.	ICML	2023	DBLP BibTeX RDF
21	Kyriakos N. Manganaris, Fotis I. Lazarakis, Kostas P. Peppas	Using Fulkerson-Ford Algorithm for UE - AP Association in mmWave Cellular Networks.	MOCAST	2023	DBLP DOI BibTeX RDF
21	Ece Sanci, Mark S. Daskin, Young-Chae Hong, Steve Roesch, Don Zhang	Mitigation strategies against supply disruption risk: a case study at the Ford Motor Company.	Int. J. Prod. Res.	2022	DBLP DOI BibTeX RDF
21	Adam Polak 0001	Bellman-Ford is optimal for shortest hop-bounded paths.	CoRR	2022	DBLP DOI BibTeX RDF
21		The Paul R. Halmos-Lester R. Ford Awards for 2021.	Am. Math. Mon.	2022	DBLP DOI BibTeX RDF
21		Interview by Martin Ford.	Probabilistic and Causal Inference	2022	DBLP DOI BibTeX RDF
21	Ming Zhang, Yu Hua 0001, Pengfei Zuo, Lurong Liu	FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory.	FAST	2022	DBLP BibTeX RDF
21	Chengyu Chuang, Yi Yang 0042	Buy Tesla, Sell Ford: Assessing Implicit Stock Market Preference in Pre-trained Language Models.	ACL (2)	2022	DBLP DOI BibTeX RDF
21	Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal A. C. Xhonneux, Jian Tang 0005	Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction.	CoRR	2021	DBLP BibTeX RDF
21	Andrew J. Simoson	Ford Circles Strike Gold.	Am. Math. Mon.	2021	DBLP DOI BibTeX RDF
21		The Paul R. Halmos-Lester R. Ford Awards for 2020.	Am. Math. Mon.	2021	DBLP DOI BibTeX RDF
21	Guangjing He, Xinchang Zhang 0002, Ying Sun, Guowei Luo, Liyan Chen	Contour line simplification method based on the two-level Bellman-Ford algorithm.	Trans. GIS	2021	DBLP DOI BibTeX RDF
21	Yuanqiu Mo, Lanlin Yu	A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm.	Syst. Control. Lett.	2021	DBLP DOI BibTeX RDF
21	Mohsen Safari, Wytse Oortwijn, Marieke Huisman	Automated Verification of the Parallel Bellman-Ford Algorithm.	SAS	2021	DBLP DOI BibTeX RDF
21	Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal A. C. Xhonneux, Jian Tang 0005	Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction.	NeurIPS	2021	DBLP BibTeX RDF
21	Jiahao Wang, Yafeng Niu, Lang Xiao, Jin Liu, Guorui Ma, Hongrui Zuo	The Color Semantics of Compact Car: A Case Study on Ford Focus.	AHFE (17)	2021	DBLP DOI BibTeX RDF
21	J. Mohan, Shweta M. Devanagaonkar, Vineeta V. Garur, A. Karthik 0006, K. Rohitaksha, A. B. Rajendra	An Improved Approach for Eliminating the Loop in Hybrid Software Defined Network (SDN) Using Modified Bellman-Ford Algorithm.	J. Interconnect. Networks	2020	DBLP DOI BibTeX RDF
21	Michael Higgins, John Ladbrook, G. Khalwadekar, M. Osman	Deterministic simulation and graphical representation of powered material handling vehicle movements to enhance pedestrian safety at the Ford Motor company.	J. Simulation	2020	DBLP DOI BibTeX RDF
21	Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll	A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control.	CoRR	2020	DBLP BibTeX RDF
21	Scott Payne, Edgar Fuller, Cun-Quan Zhang	Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson.	CoRR	2020	DBLP BibTeX RDF
21	Siddharth Agarwal, Ankit Vora, Gaurav Pandey 0004, Wayne Williams, Helen Kourous, James R. McBride	Ford Multi-AV Seasonal Dataset.	CoRR	2020	DBLP BibTeX RDF
21	Sarah E. Houts, Nahid Pervez, Umair Ibrahim, Gaurav Pandey 0004, Tyler G. R. Reid	Ford Highway Driving RTK Dataset: 30, 000 km of North American Highways.	CoRR	2020	DBLP BibTeX RDF
21		The Paul R. Halmos-Lester R. Ford Awards for 2019.	Am. Math. Mon.	2020	DBLP DOI BibTeX RDF
21	Siddharth Agarwal, Ankit Vora, Gaurav Pandey 0004, Wayne Williams, Helen Kourous, James R. McBride	Ford Multi-AV Seasonal Dataset.	Int. J. Robotics Res.	2020	DBLP DOI BibTeX RDF
21	Alexander Weber 0004, Marcus Kreuzer, Alexander Knoll	A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control.	ECC	2020	DBLP BibTeX RDF
21	Yuanqiu Mo, Soura Dasgupta, Jacob Beal	Robustness of the Adaptive Bellman -Ford Algorithm: Global Stability and Ultimate Bounds.	IEEE Trans. Autom. Control.	2019	DBLP DOI BibTeX RDF
21	Rama Devi Boddu, Kalitkar Kishan Rao, M. Asha Rani	Application of Modified Bellman-Ford Algorithm for Cooperative Communication.	Wirel. Pers. Commun.	2019	DBLP DOI BibTeX RDF
21		Breaking the Bellman-Ford Shortest-Path Bound.	CoRR	2019	DBLP BibTeX RDF
21		The Paul R. Halmos-Lester R. Ford Awards for 2018.	Am. Math. Mon.	2019	DBLP DOI BibTeX RDF
21	Yuanqiu Mo, Soura Dasgupta, Jacob Beal	Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm.	CDC	2019	DBLP DOI BibTeX RDF