7106 search results - page 174 / 1422 » Restricted Complexity, General Complexity |
161
click to vote
SIGCOMM
2006
ACM
16 years 14 days ago
2006
ACM
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
172
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
135
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: T cells recognize a complex between a specific major histocompatibility complex (MHC) molecule and a particular pathogen-derived epitope. A given epitope will elicit a...
207
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
165
click to vote
UM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The generation of formal poetry involves both complex creativity usually exercised by a human poet - and strict algorithmic restrictions regarding the metrical structure ...