Competitive online searching for a ray in the plane

A method and system are provided for converting a computer program from a current version first language to a localized version in a target language. All resource information of the program is stored in a resource dynamic link library (DLL). A current version resource DLL is separated from executable code and compared by a leverage tool to resource DLLs of a previous version of the computer program and to a previous target language translation. The leverage tool stores all resource data from the current version resource DLL as translation records in a resource database. The translation records may include translation instructions and comments. Strings in the current version resource DLL that were present in the previous version, and already translated in the previous target language resource DLL are stored in a new target language resource DLL. Strings which are not to be translated to the target language are locked. In the preferred embodiment, the new target language resource DLL and resource database are distributed to a localization vendor for translation. A translation tool allows a translator to translate the resource database to the target language. Locked strings are not translated and the already-translated strings are re-used.

[1]  Alejandro López-Ortiz,et al.  On-line parallel heuristics, processor scheduling and robot searching under the competitive framework , 2004, Theor. Comput. Sci..

[2]  Helmut Werner,et al.  Gewöhnliche Differentialgleichungen , 1986, Hochschultext.

[3]  I N Bronstein,et al.  Taschenbuch der Mathematik , 1966 .

[4]  Erik D. Demaine,et al.  Online searching with turn cost , 2004, Theor. Comput. Sci..

[5]  Tom Kamphans,et al.  Models and algorithms for online exploration and search , 2006 .

[6]  Bengt J. Nilsson,et al.  Parallel searching on m rays , 1999, Comput. Geom..

[7]  Rolf Klein,et al.  How to Find a Point on a Line Within a Fixed Distance , 1999, Discret. Appl. Math..

[8]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[9]  Rolf Klein,et al.  Algorithmische Geometrie , 1997 .

[10]  Patrick Jaillet,et al.  Online Searching , 2001, Oper. Res..

[11]  Alejandro López-Ortiz,et al.  The ultimate strategy to search on m rays? , 1998, Theor. Comput. Sci..

[12]  Sven Schuierer,et al.  Searching on m Bounded Rays Optimally , 1998 .

[13]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[14]  Sven Schuierer,et al.  A Lower Bound for Randomized Searching on m Rays , 2003, Computer Science in Perspective.

[15]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[16]  Ming-Yang Kao,et al.  Optimal constructions of hybrid algorithms , 1994, SODA '94.

[17]  Sven Schuierer,et al.  On-Line Searching in Simple Polygons , 1998, Sensor Based Intelligent Robots.

[18]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[19]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[20]  P. Hudson.  Search Games , 1982 .

[21]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms , 1993 .

[22]  Rolf Klein,et al.  On the Competitive Complexity of Navigation Tasks , 2000, Sensor Based Intelligent Robots.

[23]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[24]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2004, ESA.

[25]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[26]  Rolf Klein,et al.  Computer Science in Perspective: Essays Dedicated to Thomas Ottmann , 2003 .

[27]  Elmar Langetepe,et al.  Optimal Competitive Online Ray Search with an Error-Prone Robot , 2005, WEA.