958 results on '"Subramani, K"'
Search Results
152. Algorithmic Aspects of Risk Management
153. A New Algorithm for Linear and Integer Feasibility in Horn Constraints
154. J Clin Exp Dent
155. Comparison of SOH Prediction ML Technique for Electric Vehicles
156. A Combinatorial Algorithm for Horn Programs
157. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
158. Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
159. A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems
160. An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints
161. Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints
162. Absorbing Random Walks and the NAE2SAT Problem
163. 'Device embolization during Trans-radial percutaneous coronary intervention: Various approaches – A case series'
164. Chapter 15 - Design and fabrication of supercapacitors
165. Accomplishing Approximate FCFS Fairness Without Queues
166. A Randomized Algorithm for BBCSPs in the Prover-Verifier Model
167. Analyzing Chain Programs over Difference Constraints
168. Totally Clairvoyant Scheduling with Relative Timing Constraints
169. In vitro evaluation of osteoblast responses to carbon nanotube-coated titanium surfaces
170. Evaluation of Kumaon hill goats for resistance to natural infection with gastrointestinal nematodes
171. On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks
172. Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks
173. A New Verification Procedure for Partially Clairvoyant Scheduling
174. Zero-Clairvoyant Scheduling with Inter-period Constraints
175. A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
176. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
177. Persistent bacteremia predicts poor outcomes among neutropenic patients with carbapenem-resistant gram-negative bloodstream infections receiving appropriate therapy
178. Analyzing Selected Quantified Integer Programs
179. Resource-Optimal Scheduling Using Priced Timed Automata
180. On Boolean Models for Quantified Boolean Horn Formulas
181. Optical, electrical and ac conductivity measurements of nonlinear optical Dimethylaminomethylphthalimide doped with cadmium chloride single crystal for nano applications
182. Analytical models for risk-based intrusion response
183. A combinatorial algorithm for Horn programs
184. On Clausal Equivalence and Hull Inclusion
185. An Analysis of Quantified Linear Programs
186. Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem
187. An Analysis of Zero-Clairvoyant Scheduling
188. On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
189. On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas
190. A Specification Framework for Real-Time Scheduling
191. One-step superficial electrodeposition of nickel-cobalt-sulfide for high-energy hybrid asymmetric supercapacitor
192. Parametric Scheduling — Algorithms and Complexity
193. Parametric Scheduling for Network Constraints
194. A Dual Interpretation of 'Standard Constraints' in Parametric Scheduling
195. Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
196. Reachability problems in interval-constrained and cardinality-constrained graphs.
197. The Approximability of Partial Vertex Covers in Trees
198. On a Generalization of Horn Constraint Systems
199. Solution Treatment and Aging of Thick Rings from Titanium Alloy TI6AL4V
200. A new algorithm for the minimum spanning tree verification problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.