544 search results - page 27 / 109 » Improving Local Search for Fuzzy Scheduling Problems |
WWW
2002
ACM
14 years 8 months ago
2002
ACM
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
ISCC
2003
IEEE
14 years 1 months ago
2003
IEEE
Local area network (LAN) will be a hybrid network that includes wired and wireless links together. Nonetheless, the wired hosts always take the most bandwidth and bring about the ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
KI
1999
Springer
14 years 5 days ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...