Sciweavers

92 search results - page 19 / 19
» New Heuristics for Timeline-Based Planning
Sort
View
CP
2007
Springer
13 years 11 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
CN
2006
112views more  CN 2006»
13 years 5 months ago
Optimal server allocations for streaming multimedia applications on the Internet
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...
Padmavathi Mundur, Poorva Arankalle