2109 search results - page 324 / 422 » Solving Necklace Constraint Problems |
113
click to vote
JPDC
2006
15 years 4 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
141
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
146
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
116
click to vote
MP
2007
15 years 4 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
152
click to vote
DAGSTUHL
2001
15 years 5 months ago
2001
Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such res...