16666 search results - page 3029 / 3334 » Descriptive and Computational Complexity |
198
click to vote
SIBGRAPI
2008
IEEE
16 years 1 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...
191
click to vote
BROADNETS
2007
IEEE
16 years 1 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...
167
click to vote
CIBCB
2007
IEEE
16 years 1 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...
157
click to vote
CLUSTER
2007
IEEE
16 years 1 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...
202
click to vote
COMSWARE
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...