mplomer's library 52 articles Export

	Integer-Programming Software Systems [My Copy] Annals of Operations Research, Vol. 140, No. 1. (November 2005), pp. 67-124. by Alper Atamturk, Martin Savelsbergh posted to mip xpress-mp by mplomer on 2007-10-25 16:11:50 as
	Slicing tree is a complete floorplan representation [My Copy] Design, Automation and Test in Europe, 2001. Conference and Exhibition 2001. Proceedings (2001), pp. 228-232. by M. Lai, D. F. Wong posted to slicing_tree by mplomer on 2007-03-24 18:42:45 as
	Life on the edge: supporting collaboration in location-based experiences [My Copy] In CHI '05: Proceedings of the SIGCHI conference on Human factors in computing systems (2005), pp. 721-730. by Steve Benford, Duncan Rowland, Martin Flintham, et al.Adam Drozd, Richard Hull, Josephine Reid, Jo Morrison, Keri Facer posted to location_based_games by mplomer on 2007-01-23 23:43:51 as along with 10 people and 2 groups fidi chunjean niryuu tyfn plonsdale semiot locatellimp marcela flavian_vasile floydmueller ETEC533 HCI-Bham
	Bridging the physical and digital in pervasive gaming [My Copy] Commun. ACM, Vol. 48, No. 3. (March 2005), pp. 54-57. by Steve Benford, Carsten Magerkurth, Peter Ljungstrand posted to location_based_games by mplomer on 2007-01-23 23:42:33 as along with 3 people niryuu floydmueller Growlingfish
	Designing Ubiquitous Computing Games - A Report from a Workshop Exploring Ubiquitous Computing Entertainment [My Copy] Personal and Ubiquitous Computing, Vol. V6, No. 5. (1 December 2002), pp. 443-458. by Staffan Bjã¶rk, Jussi Holopainen, Peter Ljungstrand, Karl-Petter Ãkesson posted to location_based_games by mplomer on 2007-01-23 23:39:17 as along with 2 people and 1 group kizzie timothygreig Second Live Educators New Zealand (SLENZ)
	Game Mechanics: Describing Computer-Augmented Games in Terms of Interaction [My Copy] (2003) by S. Lundgren, S. Bjrk posted to location_based_games by mplomer on 2007-01-23 23:37:23 as
	System architecture for billing of multi-player games in a wireless environment using GSM/UMTS and WLAN services [My Copy] In NetGames '02: Proceedings of the 1st workshop on Network and system support for games (2002), pp. 58-64. by Frank Fitzek, Gerrit Schulte, Martin Reisslein posted to location_based_games by mplomer on 2007-01-23 23:34:31 as
	Are GSM Phones THE Solution for Localization? [My Copy] wmcsa, Vol. 0 (2006), pp. 34-42. by Alex Varshavsky posted to location_based_games by mplomer on 2007-01-23 23:21:11 as
	Towards Location-based Games [My Copy] In {Proceedings of the International Conference on Applications and Development of Computer Games in the 21st Century: ADCOG 21; Hongkong Special Administrative Region, China, November 22-23 2001} (November 2001), pp. 61-67. by Daniela Nicklas, Christoph Pfisterer, Bernhard Mitschang edited by Alfred, Wan H. Man, Wong Wai, Cyril T. Ning posted to location_based_games by mplomer on 2007-01-23 23:16:26 as
	Accurate GSM Indoor Localization [My Copy] UbiComp 2005: Ubiquitous Computing (2005), pp. 141-158. by Veljo Otsason, Alex Varshavsky, Anthony LaMarca, Eyal de Lara posted to location_based_games gsm_localization by mplomer on 2007-01-22 00:04:18 as along with 4 people and 1 group slowe alexanno andreala mikkelbk LocationAwareComputing
	Extending cyberspace: location based games using cellular phones [My Copy] Comput. Entertain., Vol. 4, No. 1. (January 2006) by Omer Rashid, Ian Mullins, Paul Coulton, Reuben Edwards posted to location_based_games by mplomer on 2007-01-21 16:08:27 as
	Understanding Swaps [My Copy] (1994) by John F. Marshall, Kenneth R. Kapner posted to swaps by mplomer on 2006-06-05 17:39:59 as
	Financial Derivatives [My Copy] (1993) by Robert W. Kolb posted to derivatives swaps by mplomer on 2006-06-05 17:39:59 as
	Swap Financing [My Copy] (1991) by Satyajit Das posted to swaps by mplomer on 2006-06-05 17:39:59 as
	Exact and Approximate Distances in Graphs - A Survey [My Copy] In ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms (2001), pp. 33-48. by Uri Zwick posted to matrix_algorithms shortest_paths by mplomer on 2006-01-22 20:36:00 as
	All pairs shortest paths using bridging sets and rectangular matrix multiplication [My Copy] J. ACM, Vol. 49, No. 3. (May 2002), pp. 289-317. by Uri Zwick posted to matrix_algorithms shortest_paths by mplomer on 2006-01-22 20:28:38 as along with 1 person pkordy
	Fully dynamic output bounded single source shortest path problem [My Copy] In SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (1996), pp. 212-221. by Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni posted to dynamic shortest_paths by mplomer on 2006-01-20 15:38:06 as
	On the computational complexity of dynamic graph problems [My Copy] Theoretical Computer Science, Vol. 158, No. 1. (20 May 1996), pp. 233-277. by G. Ramalingam, T. Reps posted to dynamic shortest_paths by mplomer on 2006-01-20 15:37:04 as along with 1 person mmartin
	A new approach to all-pairs shortest paths on real-weighted graphs [My Copy] Theor. Comput. Sci., Vol. 312, No. 1. (January 2004), pp. 47-74. by Seth Pettie posted to shortest_paths by mplomer on 2006-01-20 15:25:43 as
	Improved algorithm for all pairs shortest paths [My Copy] Inf. Process. Lett., Vol. 91, No. 5. (September 2004), pp. 245-250. by Yijie Han posted to shortest_paths by mplomer on 2006-01-20 15:23:08 as
	Algorithm 97: Shortest path [My Copy] Commun. ACM, Vol. 5, No. 6. (June 1962) by Robert W. Floyd posted to shortest_paths_domschke by mplomer on 2006-01-19 15:28:01 as along with 1 person mpotamias
	A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs [My Copy] In ICALP '02: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (2002), pp. 85-97. by Seth Pettie posted to shortest_paths_domschke by mplomer on 2006-01-19 15:18:49 as
	A simple and fast label correcting algorithm for shortest paths [My Copy] Netw., Vol. 23, No. 7. (July 1993), pp. 703-709. by Dimitri P. Bertsekas posted to shortest_paths by mplomer on 2006-01-19 02:37:50 as
	A new algorithm for reoptimizing shortest paths when the arc costs change [My Copy] Operations Research Letters, Vol. 31, No. 2. (March 2003), pp. 149-160. by S. Pallottino, M. G. Scutella posted to shortest_paths by mplomer on 2006-01-19 02:35:13 as
	A new dual algorithm for shortest path reoptimization [My Copy] No. TR-99-14. (JanuaryMarch, 1999) by S. Nguyen, S. Pallottino, M. G. Scutella' posted to shortest_paths by mplomer on 2006-01-19 02:33:51 as
	Algorithms for the Weight Constrained Shortest Path Problem [My Copy] International Transactions in Operational Research, Vol. 8, No. 1. (January 2001), pp. 15-29. by I. Dumitrescu, N. Boland posted to shortest_paths by mplomer on 2006-01-19 02:29:09 as
	Another Adaptive Distributed Shortest Path Algorithm [My Copy] IEEE trans. on commun., Vol. COM-39, 6 (1991), pp. 995-1003. by P. Humblet posted to shortest_paths by mplomer on 2006-01-19 02:21:14 as
	Bi-directional and heuristic search in path problems [My Copy] (1969) by Ira S. Pohl posted to shortest_paths by mplomer on 2006-01-19 02:19:50 as
	Buckets, heaps, lists and monotone priority queues [My Copy] (1997) by B. Cherkassky, A. Goldberg, C. Silverstein posted to shortest_paths by mplomer on 2006-01-19 02:18:18 as along with 1 person ima
	Dual Algorithms for the Shortest Path Tree Problem [My Copy] (1996) by Stefano Pallottino, Maria G. Scutella” posted to shortest_paths by mplomer on 2006-01-19 02:09:01 as
	Finding the k Shortest Paths [My Copy] In IEEE Symposium on Foundations of Computer Science (1994), pp. 154-165. by David Eppstein posted to shortest_paths by mplomer on 2006-01-19 00:47:01 as
	Shortest Path Problems with Resource Constraints [My Copy] (2004) by Stefan Irnich, Guy Desaulniers posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Robust Shortest Path Problem with Interval Data [My Copy] (2001) by Oya E. Karasan, Mustafa C. Pinar, Hande Yaman posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Modelling Advanced Transport Telematic Applications with Microscopic Simulators: the Case of AIMSUN [My Copy] by J. Barceló, J. Casas, J. L. Ferrer, D. Garc\ía posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Improved Preprocessing, Labeling and Scaling Algorithms for the Weight-Constrained Shortest Path Problem [My Copy] Networks (2003) by I. Dumitrescu, N. Boland posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Implementations do Dijkstra's Algorithm based on Multi-Level Buckets [My Copy] (1995) by Andrew V. Goldberg, Craig Silverstein posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Hierarchische Graphen zur Wegesuche [My Copy] (2000) by Friedhelm Buchholz posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Design and Analysis of Sequential and Parallel Single Source Shortest Path Algorithms [My Copy] (2002) by Ulrich Meyer posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Constrained Shortest Paths and Related Problems [My Copy] (2001) by Mark Ziegelmann posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Computational Efficiency of Shortest Path Algorithms in C Language [My Copy] (2005) by P. K. Mishra posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	An Auction Algorithm for Shortest Paths [My Copy] (1991) by Dimitri P. Bertsekas posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Algorithms for Time dependent Bicriteria Shortest Path Problems [My Copy] by Horst W. Hamacher, Stevanus A. Tjandra posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	A Simple Shortest Path Algorithm with Linear Average Time [My Copy] Lecture Notes in Computer Science In Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, Vol. 2161 (2001) by Andrew V. Goldberg edited by Meyer posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	A label-setting algorithm for calculating shortest path trees in sparse networks [My Copy] by L. Marton posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths [My Copy] by Benjamin Zhan, Charles E. Noon posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	A Branch and Bound algorithm for the robust shortest path problem with interval data [My Copy] (2003) by R. Montemanni, L. M. Gambardella, A. V. Donati posted to shortest_paths by mplomer on 2006-01-19 00:32:37 as
	Parallel asynchronous label-correcting methods for shortest paths [My Copy] J. Optim. Theory Appl., Vol. 88, No. 2. (February 1996), pp. 297-320. by D. P. Bertsekas, F. Guerriero, R. Musmanno posted to shortest_paths by mplomer on 2006-01-18 22:40:47 as
	Parallel shortest path auction algorithms [My Copy] Parallel Comput., Vol. 20, No. 9. (September 1994), pp. 1221-1247. by L. C. Polymenakos, D. P. Bertsekas posted to shortest_paths by mplomer on 2006-01-18 22:33:04 as
	Shortest Path Algorithms in Transportation models: classical and innovative aspects [My Copy] No. TR-97-06. (JanuaryApril, 1997) by Stefano Pallottino, Maria G. Scutellà posted to shortest_paths by mplomer on 2006-01-18 22:12:16 as along with 1 person yildizca
	Shortest Paths Algorithms: Theory and Experimental Evaluation [My Copy] In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1994) by Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik posted to shortest_paths by mplomer on 2006-01-18 22:10:55 as along with 3 people pkordy yildizca jmarcelino