-
261
Integrity of systems under decentralized integral control
Published 2009Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Get full text
Journal Article -
262
Development of interpretable spiking neural network for multiclass classification
Published 2022Subjects: “…Engineering::Computer science and engineering::Theory of computation::Computation by abstract devices…”
Get full text
Thesis-Doctor of Philosophy -
263
Wearable sensing system for improvement in sports training
Published 2015Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Thesis -
264
Incentive compatible design of reverse auctions.
Published 2013Subjects: “…DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation…”
Get full text
Research Report -
265
DNA-based computing
Published 2013Subjects: “…DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation…”
Get full text
Thesis -
266
A study on memetic computation, with applications to capacitated vehicle routing problems
Published 2014Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Thesis -
267
Mathematical strategame theory and biomolecular mediated computing
Published 2014Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Computation by abstract devices…”
Get full text
Thesis -
268
DNA mediated transistors based on multi-valued logic
Published 2013Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Logics and meanings of programs…”
Get full text
Final Year Project (FYP) -
269
Embedded computing techniques for vision-based lane change decision aid systems
Published 2013Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Thesis -
270
Soft core and hard core vector processors using vector backend
Published 2014Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Final Year Project (FYP) -
271
RF circuit and antenna optimization using space mapping technique
Published 2009Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Final Year Project (FYP) -
272
Creation of dynamic contact network through agent-based simulation
Published 2013Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity…”
Get full text
Final Year Project (FYP) -
273
Synthetic biology : modelling genetic circuits of quorum sensing, metal biosensors and biological amplifiers
Published 2015Subjects: “…DRNTU::Engineering::Computer science and engineering::Theory of computation::Computation by abstract devices…”
Get full text
Final Year Project (FYP) -
274
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions
Published 2003-06-01“…This paper combines number-theoretic results by Hardy and Ramanujan, Karamata's celebrated Tauberian theorem and techniques from the theory of computability in a perhaps surprising way.…”
Get full text
Article -
275
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions
Published 2003-01-01“…This paper combines number-theoretic results by Hardy and Ramanujan, Karamata's celebrated Tauberian theorem and techniques from the theory of computability in a perhaps surprising way.…”
Get full text
Article -
276
From formulas to cirquents in computability logic
Published 2011-04-01“…Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. …”
Get full text
Article -
277
Metacomputable
Published 2017-11-01“…The last point I need to make belongs to ontology in the theory of computability. The claim that computable objects, or processes, may produce incomputable ones does not commit us to what I call computational monism—the idea that non-computable processes may, strictly speaking, be transformed into computable ones. …”
Get full text
Article -
278
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Published 2021Get full text
Article -
279
Fundamentals of energy storage from first principles simulations: Challenges and opportunities
Published 2023-01-01Get full text
Article -
280
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Published 2022Get full text
Article