175 search results - page 28 / 35 » Lower Bounds for Dynamic Algebraic Problems |
109
click to vote
CN
2011
14 years 6 months ago
2011
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
80
Voted
IJCAI
2001
15 years 1 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
132
click to vote
TMC
2010
14 years 6 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
EOR
2006
14 years 11 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
103
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...