3415 search results - page 255 / 683 » Lower bounds on kernelization |
174
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
222
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...
158
click to vote
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 ...
179
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...