Results 11  20
of
289
Author manuscript, published in "29th International Symposium on Mathematical Foundations of Computer Science 2004, Czech Republic (2004)"
, 2011
"... Abstract. We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the sh ..."
Abstract
 Add to MetaCart
Abstract. We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts.
AE2008: A Symposium in Agentbased Computational Methods in Finance, Game Theory and their applications Artificial Economics, Annual Meeting
, 2008
"... Abstract The aim of this paper is to stress some ontological and methodological issues for AgentBased Model (ABM) building, exploration, and evaluation in the Social and Human Sciences. Two particular domain of interest are to compare ABM and simulations (Model To Model) within a given academic fie ..."
Abstract
 Add to MetaCart
field or across different disciplines and To use ontology for to discuss about the epistemic and methodological consequences of modeling choices. The paper starts with some definitions of ontology in philosophy and computer sciences. The implicit and different ontology which underlies the approach of a
An overview of computational complexity
 Communications of the ACM
, 1983
"... foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving P ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NPcompleteness. The ensuing exploration of the boundaries and nature of the NPcomplete class of problems has been one of the most active and important research activities in computer
Symposium Presentation 31 UniServe Science Blended Learning Symposium Proceedings nexus: journal of undergraduate science engineering
"... Abstract: Graduate destination survey data from the University of Tasmania (UTas 2005a) underscore the reality that a large proportion — at one extreme 79.4 % from the Bachelor of Science in 2003 — of students undertaking undergraduate degrees in the sciences do not enter the workforce upon graduati ..."
Abstract
 Add to MetaCart
graduation. Science degrees lead to further study at Honours, Masters, and PhD level. Thus undergraduate degrees in science are a foundation for research careers and should contain a greater proportion of researchoriented knowledge and practice than most other undergraduate degrees. At the University
Strategies for Motivating Minorities to Engage Computers Position Paper for the Carnegie Mellon Symposium on Minorities and Computer Science
"... In this paper I discuss a topic that is relevant and closely related to the issue of minorities and computer science, namely, the digital divide (NTIA, 1999), or the underparticipation of minorities with computers and related technologies. There are three questions that I believe are central to this ..."
Abstract
 Add to MetaCart
In this paper I discuss a topic that is relevant and closely related to the issue of minorities and computer science, namely, the digital divide (NTIA, 1999), or the underparticipation of minorities with computers and related technologies. There are three questions that I believe are central
Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacsconf.org FORWARD ANALYSIS FOR WSTS, PART I: COMPLETIONS
"... ABSTRACT. Wellstructured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the ..."
Abstract
 Add to MetaCart
ABSTRACT. Wellstructured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now
Programming in HigherOrder Typed LambdaCalculi
, 1989
"... on Foundations of Computer Science, pages 279282, IEEE, October 1988. [55] J. SteensgaardMadsen. Typed representation of objects by functions. ACM Transactions on Programming Languages and Systems, 11(1):6789, January 1989. 71 [31] [33] [34] [35] Grard Huet. A unification algorithm for ty ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
on Foundations of Computer Science, pages 279282, IEEE, October 1988. [55] J. SteensgaardMadsen. Typed representation of objects by functions. ACM Transactions on Programming Languages and Systems, 11(1):6789, January 1989. 71 [31] [33] [34] [35] Grard Huet. A unification algorithm
Hardness assumptions in the foundations of . . .
"... The original impetus for writing this expository note was an idea of J. Neˇsetˇril to edit a series of articles (in a series edited at the Institute for Theoretical Informatics at the Charles University in Prague) on the state of Theoretical Computer Science (TCS). Additional excuses were a lecture ..."
Abstract
 Add to MetaCart
The original impetus for writing this expository note was an idea of J. Neˇsetˇril to edit a series of articles (in a series edited at the Institute for Theoretical Informatics at the Charles University in Prague) on the state of Theoretical Computer Science (TCS). Additional excuses were a lecture
An Optimal Algorithm for Monte Carlo Estimation
, 1995
"... A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in [0; 1] with E[Z] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a ..."
Abstract

Cited by 64 (4 self)
 Add to MetaCart
of the Thirtysixth IEEE Symposium on Foundations of Computer Science, 1995, pp. 142149 [3]. Section ...
Symposium Neurotech for Neuroscience: Unifying Concepts, Organizing Principles, and Emerging Tools
"... The ability to tackle analysis of the brain at multiple levels simultaneously is emerging from rapid methodological developments. The classical research strategies of “measure, ” “model, ” and “make ” are being applied to the exploration of nervous system function. These include novel conceptual and ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
, mathematics, and engineering. Funding agencies, including the National Science Foundation, explore the potential of these changing frontiers of research for developing research policies and longterm planning. Key words: motor system; mathematical modeling; transformative research neuromorphic chips
Results 11  20
of
289