1802 search results - page 128 / 361 » Complexity Theory for Operators in Analysis |
148
click to vote
ALENEX
2004
15 years 7 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
186
click to vote
AFRIGRAPH
2007
ACM
15 years 10 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
194
click to vote
CI
2005
15 years 6 months ago
2005
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
189
click to vote
SPLC
2010
15 years 7 months ago
2010
Abstract. Large product lines have complex build systems, which obscure mapping of features to code. We extract this mapping out of the build systems of two operating systems kerne...
163
click to vote
GECCO
2009
Springer
16 years 28 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...