16404 search results - page 2412 / 3281 » A set coverage problem |
210
click to vote
SIGECOM
2008
ACM
15 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
213
click to vote
IJRR
2007
15 years 7 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
239
click to vote
TELSYS
2008
15 years 7 months ago
2008
With the number of e-Business applications dramatically increasing, a service level agreement (SLA) will play an important part in Web services. The SLA is a combination of severa...
189
click to vote
TIT
2008
15 years 7 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
253
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...