DSpace Repository

Browsing by Title

Browsing by Title

Sort by: Order: Results:

  • Chan H C; Wei K K; Siau K L (1992-03-01)
    Abstract not available.
  • Stan Jarzabek; Tok Wang Ling (1995-03-01)
    What do we need to know about the business in order to understand and, eventually, to improve business operations? Many business modeling methods have been described in literature and applied in business re-engineering ...
  • Freivalds Rusins; Jain Sanjay (1994-06-01)
    Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of `minimal' and `nearly minimal' programs ...
  • ZHAO, Feng; TUNG, Anthony K. H. (2012-04-03)
    Graphs are widely used in large scale social network analysis nowadays. Not only analysts need to focus on cohesive subgraphs to study patterns among social actors, but also normal users are interested in discovering what ...
  • Zhou Wanlei (1993-06-01)
    Abstract not available.
  • Anthony H Dekker (1994-07-01)
    In this paper we define the Lazy Lambda Calculus with constants, which extends Abramsky's pure lazy Lambda Calculus. This calculus forms a model for modern lazy functional programming languages. Such languages usually ...
  • BASU, Debabrota; WANG, Xiayang; HONG, Yang; CHEN, Haibo; BRESSAN, Stéphane (2017-04-04)
    Cloud providers leverage live migration of virtual machines to reduce energy consumption and allocate resources efficiently in data centers. Each migration decision depends on three questions: when to move a virtual machine, ...
  • JAIN, Sanjay; LUO, Qinglong; STEPHAN, Frank (2009-01-29)
    The present work initiates the study of the learnability of automatic indexable classes which are classes of regular languages of a certain form. It is characterised which of these classes are explanatorily learnable. ...
  • CARLUCCI, Lorenzo; CASE, John; JAIN, Sanjay (2006-12-18)
    We investigate a new paradigm in the context of learning in the limit, namely, learning correction grammars for classes of r.e. languages. Knowing a language may feature a representation of the target language in terms of ...
  • S Romaniuk (1993-06-01)
    The problem of deriving membership functions as a means for describing linguistic variables (for some control process) and the choice of fuzzy inference operators and connectives is at the heart of developing fuzzy control ...
  • JAIN, Sanjay; STEPHAN, Frank (2007-11-14)
    In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar equivalence problem compared to acceptable ...
  • Sanjay JAIN; Efim KINBER (2004-04-01)
    A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, superset, and subset queries are considered ...
  • Sanjay JAIN; Efim KINBER (2004-04-01)
    In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the conjectures made by the learner. Several ...
  • Steve Romanuik (1994-01-01)
    Traditionally, large areas of research in machine learning have concentrated on pattern recognition and its application to many diversified problems both within the realm of AI as well as outside of it. Over several decades ...
  • Sanjay Jain (1997-05-01)
    Abstract not available.
  • Stan Jarzabek (1992-09-01)
    Abstract not available.
  • Tan Gary; Chin W N (1992-11-01)
    Abstract not available.
  • STEPHAN, Frank; LIANG, Yu (2005-12-20)
    It is shown that a set is low for weakly 1-generic iff it has neither dnr nor hyperimmune Turing degree. As this notion is more general than being recursively traceable, this answers negatively a recent question on the ...
  • FIGUEIRA, Santiago; NIES, Andre; STEPHAN, Frank (2005-11-10)
    We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A ...
  • JU, Lei; BANERJEE, Ansuman; ROYCHOUDHURY, Abhik; SENGUPTA, Bikram (2010-10-28)
    A multi-tenant software as a service (SaaS) system has to meet the needs of several tenant organizations, which connect to the system to utilize its services. To leverage economies of scale through reuse, a SaaS vendor ...

Search DSpace

Browse

My Account