1218 search results - page 95 / 244 » The many facets of natural computing |
132
Voted
COCO
2004
Springer
15 years 11 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
156
Voted
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
152
Voted
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers h...
143
Voted
VL
2002
IEEE
15 years 11 months ago
2002
IEEE
Research into the cognitive aspects of programming originated in the study of professional programmers (whether experts or students). Even “end-user” programmers in previous s...
180
Voted
AISC
2010
Springer
15 years 11 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...