4229 search results - page 222 / 846 » On the Optimality of Spiral Search |
113
click to vote
IJAIT
2007
15 years 1 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
135
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
CHI
2010
ACM
15 years 8 months ago
2010
ACM
It has been well understood that optimized soft keyboard layouts improve motor movement efficiency over the standard Qwerty layouts, but have the drawback of long initial visual s...
139
click to vote
INFOCOM
2010
IEEE
15 years 1 days ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
124
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...