3946 search results - page 687 / 790 » The computational complexity of choice sets |
154
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
190
click to vote
INFORMS
2010
15 years 4 months ago
2010
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
158
click to vote
KAIS
2010
15 years 4 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
182
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
166
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
Abstract. Broadcast (BC) is considered as the most fundamental primitive for fault-tolerant distributed computing and cryptographic protocols. An important and practical variant of...