2783 search results - page 312 / 557 » The Nature Of Near-Synonymic Relations |
105
Voted
TSP
2008
15 years 1 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
130
Voted
JSW
2007
15 years 1 months ago
2007
— Providing powerful and fine-grained capabilities for the analysis and management of non-functional properties is a major challenge for component-based software systems. This a...
110
Voted
ACTA
2002
15 years 1 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
125
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
127
click to vote
COMBINATORICS
2004
15 years 1 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...