14774 search results - page 439 / 2955 » Computational complexity and evolutionary computation |
164
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
172
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
151
click to vote
ICECCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Production of a large-scale software system involves quite a few software components. It is very common to develop such software components in a distributed environment consisting...
178
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
224
click to vote
AMC
2011
15 years 1 months ago
2011
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...