A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns
スポンサーリンク
概要
- 論文の詳細を見る
- 2008-03-01
著者
-
BOROS Endre
Rutgers Center for Operations Research, Rutgers University
-
Ibaraki Toshihide
Department of Informatics, Kwansei Gakuin University
-
Yagiura Mutsunori
Department of Computer Science and Mathematical Informatics, Nagoya University
-
Boros Endre
Rutgers Center For Operations Research Rutgers University
-
HARAGUCHI Kazuya
Department of Information Technology and Electronics, Faculty of Science and Engineering, Ishinomaki
-
Haraguchi Kazuya
Department Of Information Technology And Electronics Faculty Of Science And Engineering Ishinomaki S
-
Haraguchi Kazuya
Department Of Applied Mathematics And Physics Graduate School Of Informatics Kyoto University
-
Yagiura Mutsunori
Department Of Computer Science And Mathematical Informatics Graduate School Of Information Science N
-
Yagiura Mutsunori
Department Of Applied Mathematics And Physics Graduate School Of Informatics Kyoto University
-
Ibaraki Toshihide
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
Ibaraki Toshihide
Kwansei Gakuin Univ. Sanda‐shi Jpn
-
Ibaraki Toshihide
Department Of Informatics School Of Science And Technology Kwansei Gakuin University
-
BOROS Endre
Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University
-
YAGIURA Mutsunori
Rutgers Center for Operations Research, Rutgers University
関連論文
- 局所探索法とその拡張 : タブー探索法を中心として
- A Set Covering Approach for the Pickup and Delivery Problem with Additional Constraints (Numerical Optimization methods, theory and applications)
- 多制約配送計画問題に対する集合被覆アプローチ
- 分枝限定法 : さらなる計算効率の希求(堅く柔らかく…数理計画アプローチ再訪)
- 2-A-3 MAX-2-SATに対する分枝限定法の改良(離散最適化(3))
- 1-A-5 矩形パッキング問題に対する厳密解法(離散最適化(2))
- 矩形パッキング問題に対する厳密解法
- MAX-2-SATに対する分枝限定法(組合せ最適化(4))
- MAX-2-SATに対する分枝限定法
- ルール生成に必要なデータ量に関するランダム性に基づいた解析
- 1-D-1 ルール生成に必要なデータ量に関するランダム性に基づいた解析(マーケティング(1))
- 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
- 5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)
- オプションプライシングと凸計画問題の関係について(金融工学(3))
- 長方形詰込み問題に対する可変近傍探索法(組合せ最適化(4))
- 移動時間コスト関数を考慮した時間枠つき配送計画問題に対する局所探索法 (数理最適化から見た「凸性の深み,非凸性の魅惑」)
- 点容量付き内向木詰込問題の計算複雑度
- A Simple Proof of a Minimum Cut Algorithm and Its Applications
- A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns
- 4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)
- 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)
- A Note on Approximating the Survivable Network Design Problem in Hypergraphs(Special Issue on Selected Papers from LA Symposium)
- An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns
- Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge(Discrete Mathematics and Its Applications)
- 不完全データの論理的解析
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- A Fast Algorithm for Cactus Representations of Minimum Cuts
- Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree (Special Section on Discrete Mathematics and Its Applications)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan)
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- 1A1 Scheduling of Corrugated Paper Production(Technical session 1A: Combinatorial optimization)
- A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
- AN ASSIGNMENT PROBLEM ON A NETWORK
- MINIMUM DELAY SEMIJOIN SCHEDULES FOR LOCAL AREA DISTRIBUTED DATABASE SYSTEMS(Mathematical Theories on Computing Schemes and Their Applications)
- Building General Solvers for Scheduling Problems(KEYNOTE SPEECHES)
- Approximability of the Minimum Maximal Matching Problem in Planar Graphs(Graphs and Networks)
- An Approximation of the Minimum Vertex Cover in a Graph
- Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions
- ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
- PARTIALLY DEFINED BOOLEAN FUNCTIONS WITH APPLICATIONS TO DATA ANALYSIS : A SURVEY
- Heuristic Algorithms for Rectilinear Block Packing (アルゴリズムと計算理論の新展開 : RIMS研究集会報告集)
- How to Produce BlockSum Instances with Various Levels of Difficulty
- 1-D-4 Heuristics for the Rectilinear Block Packing Problem
- 一般化上界制約付き集合多重被覆問題に対する発見的解法 (最適化手法の理論と応用の繋がり)
- 3次元箱詰め問題に対する構築型解法の効率的実現法
- 2-A-9 一般化上界制約付き集合多重被覆問題に対する発見的解法(特別セッション スモールビジネスOR(1))
- 汎用ソルバーによる研究集会開催日程スケジューリングの自動化(論文・事例研究)
- 2-A-5 最適化アルゴリズムを実装する際の留意点について : 組合せ最適化問題に対するメタヒューリスティクスの場合を中心として(特別セッション 最適化の実装技術)
- RA-005 3次元パッキング問題に対するbest-fit法の効率的実現法(アルゴリズム・コンピュテーション(3),A分野:モデル・アルゴリズム・プログラミング)
- 頂点容量制約付き有向全域木パッキング問題に対するラグランジュ緩和に基づく列生成法