17541 search results - page 3211 / 3509 » Complexity in scalable computing |
166
click to vote
SIBGRAPI
2008
IEEE
15 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
168
Voted
ACRI
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
169
click to vote
BROADNETS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
134
click to vote
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
134
click to vote
CLUSTER
2007
IEEE
15 years 11 months ago
2007
IEEE
— Various mechanisms for fault-tolerance (FT) are used today in order to reduce the impact of failures on application execution. In the case of system failure, standard FT mechan...