Jump to main content

yr 〜
yr

Search results 33

Proposal of Superior Solution Set Search Problem and Construction of Superior Solution Set Search Methods Based on Metaheuristics

Proposal of Superior Solution Set Search Problem and Construction of Superior Solution Set Search Methods Based on Metaheuristics
Digital博士論文障害者向け資料あり
オウ, コウネン, 王, 鴻燃, Wang, Hongran2021-03-25
National Diet Library

Route search problem considering travel time reliability and CO2 emission in road network

Route search problem considering travel time reliability and CO2 emission in road network
Digital博士論文障害者向け資料あり
ZENG, Weiliang, 曾, 偉良2016-03-25
National Diet Library

Study on discrete quantum adiabatic computation in combinatorial search problems

Study on discrete quantum adiabatic computation in combinatorial search problems
Paper博士論文
Mohamed El-Fiky [著][Mohamed El-Fiky][2012]<UT51-2013-F620>
National Diet Library

Efficient algorithms for geometric searching problems

Efficient algorithms for geometric searching problems
PaperDigital博士論文障害者向け資料あり
譚学厚 [著]<UT51-92-S16>
Available onlineNational Diet Library

類似検索問題に対するクエリ・アウェア局所鋭敏ハッシング

類似検索問題に対するクエリ・アウェア局所鋭敏ハッシング
Digital博士論文障害者向け資料あり
陸, 可鏡Hokkaido University2021-03-25
Available onlineNational Diet LibraryOther Libraries in Japan
  • Summary, etc.... of similarity search problems vary highly ov......arest neighbor search problems. For this purpose, we propose...
  • Alternative TitleQuery-Aware Locality Sensitive Hashing for Similarity Search Problems
  • Alternative TitleQuery-Aware Locality Sensitive Hashing for Similarity Search Problems

Acquisition search problem A61-3622 JHU APL BB-291

Acquisition search problem A61-3622 JHU APL BB-291
Microform規格・テクニカルリポート類
Schwab, Verne1960<F-IA-40>
National Diet Library

Some special search problems RAND/P-1822

Some special search problems RAND/P-1822
Paper規格・テクニカルリポート類
Gross, O. A1959<M-RAND/P-1822>
National Diet Library

A search problem due to Bellman RAND/RM-1603

A search problem due to Bellman RAND/RM-1603
Paper規格・テクニカルリポート類
Gross, O. A1955<M-RAND/RM-1603>
National Diet Library

グラフ上の探索問題に対する最適な意思決定方策の数理的探求

グラフ上の探索問題に対する最適な意思決定方策の数理的探求
Paper図書
菊田健作, 兵庫県立大学 [著][菊田健作]2005-2007<Y151-H17510131>
National Diet Library
  • Alternative TitleMathematical studies on optimal decisions for search problems on finite graphs
  • Alternative TitleMathematical studies on optimal decisions for search problems on finite graphs

グラフ上の探索問題に対する最適解の解析的探究

グラフ上の探索問題に対する最適解の解析的探究
Paper図書
菊田健作, 神戸商科大学 [著][菊田健作]2001-2003<Y151-H13680525>
National Diet Library
  • Alternative TitleMathematical studies on optimal solutions for search problems on graphs
  • Alternative TitleMathematical studies on optimal solutions for search problems on graphs

Route search problem considering travel time reliability and CO2 emission in road network

Route search problem considering travel time reliability and CO2 emission in road network
Digital博士論文
ZENG, Weiliang, 曾, 偉良2016-03-25
Available onlineOther Libraries in Japan

Optimal Online Algorithms for the Multi-Objective Time Series Search Problem

Optimal Online Algorithms for the Multi-Objective Time Series Search Problem
Paper文書・図像類
長谷川, 駿, Hasegawa, Shun, 伊東, 利哉, Itoh, Toshiya2015-06
Other Libraries in Japan

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems
Paper文書・図像類
伊東, 利哉, Itoh, Toshiya, 武井, 由智, Takei, Yoshinori2017-12
Other Libraries in Japan

Search problems

Search problems
Paper図書
Rudolf Ahlswede and Ingo Wegener ; translated by Jean E. WotschkeWileyc1987
Other Libraries in Japan

Search problems. (AMP Memorandum No. 80.1) OSRD-Div.AMP-703.4-M6 OEMsr-1007

Search problems. (AMP Memorandum No. 80.1) OSRD-Div.AMP-703.4-M6 OEMsr-1007
Microform規格・テクニカルリポート類
Hestenes, Magnus R1943<F-OS-39>
National Diet Library

[Search problems.] Report titled: Comment on AMP Memoranda 80.2 and 80.3. (AMP Memorandum No. 80.4) OSRD-Div.AMP-703.4-M8

[Search problems.] Report titled: Comment on AMP Memoranda 80.2 and 80.3. (AMP Memorandum No. 80.4) OSRD-Div.AMP-703.4-M8
Microform規格・テクニカルリポート類
1943<F-OS-39>
National Diet Library

Some thoughts on a job search problem on a partially observable Markov chain

Some thoughts on a job search problem on a partially observable Markov chain
Paper図書
Tōru NakaiFaculty of Economics, Kyushu University2003
Other Libraries in Japan

101 great answers to the toughest job search problems : pbk.

101 great answers to the toughest job search problems : pbk.
Paper図書
by Ollie StevensonCareer Pressc1995
Other Libraries in Japan
  • Alternative Title...e toughest job search problems One hundred an......e toughest job search problems
  • Alternative Title...e toughest job search problems One hundred an......e toughest job search problems

Efficient algorithms for geometric searching problems

Efficient algorithms for geometric searching problems
Paper図書
Xue-Hou Tan[s.n.][1992]
Other Libraries in Japan

A Completeness Theorem for Polynomial-Time Local Search Problems

A Completeness Theorem for Polynomial-Time Local Search Problems
Digital文書・図像類
下薗, 真一Research Institute of Fundamental Information Science, Kyushu University1990-12-28RIFIS Technical Report33
Available onlineOther Libraries in Japan
  • Summary, etc....ial-time local search problems, which are defined to formali...
RSS