Results 1  10
of
4,845,412
Genomic Expression Programs in the Response of Yeast Cells to Environmental Changes
 Mol. Biol. Cell
, 2000
"... this article contains data set material, and is available at www.molbiolcell.org. ..."
Abstract

Cited by 743 (21 self)
 Add to MetaCart
this article contains data set material, and is available at www.molbiolcell.org.
An Overview of the C++ Programming Language
, 1999
"... This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction, ..."
Abstract

Cited by 1766 (15 self)
 Add to MetaCart
This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP
The large N limit of superconformal field theories and supergravity
, 1998
"... We show that the large N limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of AntideSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and ..."
Abstract

Cited by 5673 (21 self)
 Add to MetaCart
We show that the large N limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of AntideSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory
N Degrees of Separation: MultiDimensional Separation of Concerns
 IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 1999
"... Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a
Environmental Protection Agency
 Environmental Labeling: Issues, Policies, and Practices Worldwide
, 1998
"... Contract No. 68C70051 ..."
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 682 (6 self)
 Add to MetaCart
(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical
Macroscopic strings as heavy quarks in large N gauge theory and Antide Sitter supergravity
 PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and antide Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract

Cited by 510 (1 self)
 Add to MetaCart
Maldacena has put forward large N correspondence between superconformal field theories on the brane and antide Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3brane and maximal supergravity on adS5 × S5 by introducing
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and nperson games
 Artificial Intelligence
, 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
Abstract

Cited by 1169 (11 self)
 Add to MetaCart
The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments is precisely defined. We show that logic programming and nonmonotonic reasoning in AI are different forms of argumentation. We show that argumentation can be viewed as a special form of logic programming with negation as failure. This result introduces a general method for generating metainterpreters for argumentation systems. 1.
Results 1  10
of
4,845,412