Results 1  10
of
680,612
1 The Nontrivial Problem of Crossdisciplinary Science and
, 2010
"... Crossdisciplinary use of science is needed to solve complex, realworld problems, but carrying out scientific research with multiple very different disciplines is in itself a nontrivial problem. Perspectives matter. In this paper we carry out a philosophical analysis of the perspectival nature of ..."
Abstract
 Add to MetaCart
Crossdisciplinary use of science is needed to solve complex, realworld problems, but carrying out scientific research with multiple very different disciplines is in itself a nontrivial problem. Perspectives matter. In this paper we carry out a philosophical analysis of the perspectival nature
Genetic programming: Biologically inspired computation that exhibits creativity in solving nontrivial problems
 In Proceedings of the AISB’99 Symposium on Scientific Creativity
, 1999
"... This paper describes a biologically inspired domainindependent technique, called genetic programming, that automatically creates computer programs to solve problems. We argue that the field of design is a useful testbed for determining whether an automated technique can produce results that are com ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This paper describes a biologically inspired domainindependent technique, called genetic programming, that automatically creates computer programs to solve problems. We argue that the field of design is a useful testbed for determining whether an automated technique can produce results
The formal development of nontrivial programs in constructive type theory
"... This paper is intended to show how nontrivial problems can be specified and solved in MartinLöf’s Type Theory. A particular class of problems is considered which contains some game problems. ..."
Abstract
 Add to MetaCart
This paper is intended to show how nontrivial problems can be specified and solved in MartinLöf’s Type Theory. A particular class of problems is considered which contains some game problems.
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
The Symbol Grounding Problem
, 1990
"... There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system be m ..."
Abstract

Cited by 1072 (18 self)
 Add to MetaCart
There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system
AROUND NONTRIVIAL BACKGROUNDS
, 1993
"... We present a way of constructing string solutions around nontrivial gravitational backgrounds. The proposed solutions are constructed using N = 4 superconformal building blocks with ĉ = 4. We give two different and inequivalent realizations of nontrivial fourdimensional subspaces, and we show the ..."
Abstract
 Add to MetaCart
We present a way of constructing string solutions around nontrivial gravitational backgrounds. The proposed solutions are constructed using N = 4 superconformal building blocks with ĉ = 4. We give two different and inequivalent realizations of nontrivial fourdimensional subspaces, and we show
The Effective Potential of NonTrivial
"... Massless O(N)symmetric OE 4 theory, which has a nontrivial scaling limit for a negative quartic coupling constant, is investigated in leading order of a 1=Nexpansion, where a negative bare coupling naturally arises due to the nonperturbative renormalisation. The influence of an external sourc ..."
Abstract
 Add to MetaCart
Massless O(N)symmetric OE 4 theory, which has a nontrivial scaling limit for a negative quartic coupling constant, is investigated in leading order of a 1=Nexpansion, where a negative bare coupling naturally arises due to the nonperturbative renormalisation. The influence of an external
Results 1  10
of
680,612