3433 search results - page 544 / 687 » Heuristics for a bidding problem |
194
click to vote
PDPTA
2000
15 years 7 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
172
click to vote
IJCAI
1989
15 years 7 months ago
1989
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...
193
click to vote
CN
2006
15 years 6 months ago
2006
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
170
click to vote
COR
2007
15 years 6 months ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
172
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...