775 results on '"Makino, Kazuhisa"'
Search Results
102. A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games
103. The Linear Complementarity Problems with a Few Variables per Constraint
104. Randomized algorithms for online knapsack problems
105. Unit Cost Buyback Problem
106. A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions
107. Randomized Algorithms for Removable Online Knapsack Problems
108. Sparse Linear Complementarity Problems
109. Online Knapsack Problem with Removal Cost
110. Nash Equilibria with Minimum Potential in Undirected Broadcast Games
111. Computing Knapsack Solutions with Cardinality Robustness
112. Robust Independence Systems
113. Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
114. Robust Matchings and Matroid Intersections
115. Caching Is Hard – Even in the Fault Model
116. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF
117. A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
118. Online Minimization Knapsack Problem
119. Online removable knapsack problem under convex function
120. Online Knapsack Problems with Limited Cuts
121. Posi-modular Systems with Modulotone Requirements under Permutation Constraints
122. Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
123. A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
124. On the Readability of Monotone Boolean Formulae
125. On Berge Multiplication for Monotone Boolean Dualization
126. Deductive Inference for the Interiors and Exteriors of Horn Theories
127. A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
128. On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions
129. Generating Minimal k-Vertex Connected Spanning Subgraphs
130. On the Boolean Connectivity Problem for Horn Relations
131. Minimum Transversals in Posi-modular Systems
132. Minimum Cost Source Location Problems with Flow Requirements
133. Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden 2 × 2 subgames
134. Minimizing a Monotone Concave Function with Laminar Covering Constraints
135. An O(n log2 n) Algorithm for a Sink Location Problem in Dynamic Tree Networks
136. Generating Paths and Cuts in Multi-pole (Di)graphs
137. New Algorithms for Enumerating All Maximal Cliques
138. Nash equilibria with minimum potential in undirected broadcast games
139. Generating All Abductive Explanations for Queries on Propositional Horn Theories
140. An Intersection Inequality for Discrete Distributions and Related Generation Problems
141. Abduction and the Dualization Problem
142. Minimum Edge Ranking Spanning Trees of Threshold Graphs
143. Generating Partial and Multiple Transversals of a Hypergraph
144. Locating Sources to Meet Flow Demands in Undirected Networks
145. Max- and Min-Neighborhood Monopolies
146. Logical Analysis of Data with Decomposable Structures
147. Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv
148. Finding Essential Attributes in Binary Data
149. On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets
150. A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.