Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK

First Page		Document Content
Date: 2015-09-04 10:24:56 Operations research Edsger W. Dijkstra Network theory Shortest path problem Mathematical optimization Routing algorithms Systems engineering Dynamic programming		Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK Add to Reading List Source URL: www.monmeetings.org Download Document from Source Website File Size: 320,52 KB Share Document on Facebook

	University of Washington Database Group Quarterly Newsletter - FallUW Database Group Data management systems, cloud services, probabilistic databases, and data pricing in Computer Science & Engineering at the Univ DocID: 1xV2p - View Document
	RESEARCH LINES Mapping SHiNE RiSE Rigorous Systems Engineering DocID: 1xUZO - View Document
	Georgios Fainekos School of Computing, Informatics and Decision Systems Engineering, Arizona State University. Office address: 660 W 6th St, STE, Tempe, AZweb: http://www.public.asu.edu/~gfaineko/, email: f DocID: 1xUnB - View Document
	A Relational Encoding for a Clash-Free Subset of ASMs Gerhard Schellhorn, Gidon Ernst, J¨org Pf¨ahler, and Wolfgang Reif Institute for Software and Systems Engineering University of Augsburg, Germany {schellhorn,ernst, DocID: 1xUbX - View Document