3864 search results - page 134 / 773 » time 2005 |
143
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
135
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
A simple method for animation of water waves is presented. The two-dimensional wave equation with damping is used to obtain a finite difference scheme for height distribution. A ...
142
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
175
click to vote
COR
2007
15 years 6 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
145
click to vote
FOCS
2005
IEEE
16 years 6 hour ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...