1603 search results - page 256 / 321 » Multi-Dimensional Heuristic Searching |
142
Voted
SIGIR
2003
ACM
15 years 9 months ago
2003
ACM
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
177
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
121
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
151
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
137
click to vote
CHI
2007
ACM
15 years 8 months ago
2007
ACM
With new technology, people can share information about everyday places they go; the resulting data helps others find and evaluate places. Recent applications like Dodgeball and S...