Sciweavers

1940 search results - page 148 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
15 years 11 months ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
BMCBI
2008
121views more  BMCBI 2008»
15 years 6 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
ECIR
2011
Springer
14 years 10 months ago
Enhancing Deniability against Query-Logs
We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates the target search resu...
Avi Arampatzis, Pavlos Efraimidis, George Drosatos
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ATAL
2003
Springer
15 years 11 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara