5055 search results - page 775 / 1011 » Relative Timing |
181
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
181
click to vote
STTT
2010
15 years 4 months ago
2010
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
163
click to vote
VLDB
2010
ACM
15 years 4 months ago
2010
ACM
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
182
click to vote
WIAS
2010
15 years 4 months ago
2010
The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved info...
171
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...