3208 search results - page 235 / 642 » A Lower Bound for Primality |
221
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
157
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
165
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
178
click to vote
WDAG
1999
Springer
15 years 11 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
152
click to vote
SIROCCO
2007
15 years 8 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...