410 results on '"Matsui, Tomomi"'
Search Results
2. Algorithms for Computing Geometric Measures of Melodic Similarity
3. Dynamic Programming and Linear Programming for Odds Problem
4. A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case
5. New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
6. Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games
7. Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games
8. Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games
9. Trading transforms of non-weighted simple games and integer weights of weighted simple games
10. A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
11. Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
12. Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
13. Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
14. Additive Approximation Algorithms for Modularity Maximization
15. A doubly nonnegative relaxation for modularity density maximization
16. A formulation of mask optimization into QUBO model for Ising machines
17. Fractional programming formulation for the vertex coloring problem
18. Lower Bounds for Bruss' Odds Problem with Multiple Stoppings
19. A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
20. Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
21. Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
22. COMPARE THE RATIO OF SYMMETRIC POLYNOMIALS OF ODDS TO ONE AND STOP
23. Efficient algorithm for assigning agents to a line (New Developments on Mathematical Decision Making Under Uncertainty)
24. Lower Bounds for Bruss' Odds Problem with Multiple Stoppings
25. Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography
26. Ergothioneine protects Streptomyces coelicolor A3(2) from oxidative stresses
27. Mask Optimization Method Using Simulated Quantum Annealing
28. A formulation of mask optimization into QUBO model for Ising machines
29. A NOTE ON A LOWER BOUND FOR THE MULTIPLICATIVE ODDS THEOREM OF OPTIMAL STOPPING
30. Acceleration of Mask Optimization Using Gradient Deciding Method and Subgradient Method
31. Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists
32. Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
33. Monte Carlo Methods for the Shapley--Shubik Power Index
34. An Improved Approximation Algorithm for the Traveling Tournament Problem
35. Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution
36. Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
37. Constructive Algorithms for the Constant Distance Traveling Tournament Problem
38. Approximation Algorithms for Minimum Span Channel Assignment Problems
39. Perfectness and Imperfectness of the kth Power of Lattice Graphs
40. Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling
41. Efficient Algorithms for the Electric Power Transaction Problem
42. 頂点彩色問題の定式化を応用したスラブ山分け問題求解技術開発
43. Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables
44. Characterizing Feasible Pattern Sets with a Minimum Number of Breaks
45. Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
46. Integer Programming Based Algorithms for Peg Solitaire Problems
47. 0.863-Approximation Algorithm for MAX DICUT
48. Sealed Bid Multi-object Auctions with Necessary Bundles and its Application to Spectrum Auctions
49. Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
50. On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.