Results 1  10
of
2,167,173
Open Problems
, 1991
"... . Graph minors is a field that has motivated numerous investigations in discrete mathematics and computers science, a fact demonstrated by the variety of papers and open problems appearing in this volume. This section summarizes those problems which were submitted by participants of the conference f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Graph minors is a field that has motivated numerous investigations in discrete mathematics and computers science, a fact demonstrated by the variety of papers and open problems appearing in this volume. This section summarizes those problems which were submitted by participants of the conference
A case study of open source software development: the Apache server
 In: Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000
, 2000
"... According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source applica ..."
Abstract

Cited by 805 (32 self)
 Add to MetaCart
According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source
Optimal approximation by piecewise smooth functions and associated variational problems
 Commun. Pure Applied Mathematics
, 1989
"... (Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Mumford, David Bryant, and Jayant Shah. 1989. Optimal approximations by piecewise smooth functions and associated variational problems. ..."
Abstract

Cited by 1297 (14 self)
 Add to MetaCart
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Mumford, David Bryant, and Jayant Shah. 1989. Optimal approximations by piecewise smooth functions and associated variational problems
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 776 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 845 (17 self)
 Add to MetaCart
very simple network leads to some interesting mathematics, results, and open problems.
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 597 (36 self)
 Add to MetaCart
. We conclude with some future work directions and open problems.
Open Problems
"... Type theory is fundamental both in logic and computer science. In computer science, type theory refers to the design, analysis and study of type systems. Generally, a type system is used to prevent the occurrences of errors during the evolution of a system. A type inference procedure determines the ..."
Abstract
 Add to MetaCart
Type theory is fundamental both in logic and computer science. In computer science, type theory refers to the design, analysis and study of type systems. Generally, a type system is used to prevent the occurrences of errors during the evolution of a system. A type inference procedure determines the minimal requirements to accept a system or a component as welltyped. Membrane systems consider cells as mechanisms working in a maximal parallel and nondeterministic manner. However, the living cells do not work in such a way: a chemical reaction takes place only if certain quantitative constraints are fulfilled. In order to cope with such constraints, membrane systems should be enriched by adding a quantitative type discipline, and making use of type inference and principal typing [2]. We associate to each reduction rule a minimal set of constraints that must be satisfied in order to assure that by the application of this rule to a wellformed membrane system, we get a wellformed membrane system as well. A first step in this direction was done in [1] where a type system for membrane system with symport/antiport rules is given.
Open problems
 Lambda Calculus and Computer Science Theory
, 1975
"... a coding scheme for detecting usability and fun ..."
Results 1  10
of
2,167,173