7106 search results - page 174 / 1422 » Restricted Complexity, General Complexity |
117
Voted
SIGCOMM
2006
ACM
15 years 9 months 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 ...
122
Voted
GECCO
2006
Springer
15 years 7 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, ...
BMCBI
2006
15 years 3 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...
160
Voted
CORR
2008
Springer
15 years 2 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...
131
Voted
UM
2001
Springer
15 years 8 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 ...