Sciweavers

6036 search results - page 61 / 1208
» Web search solved
Sort
View
ECAI
2000
Springer
14 years 1 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
AIR
2004
134views more  AIR 2004»
13 years 9 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 4 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
APVIS
2006
13 years 11 months ago
Information gathering support interface by the overview presentation of web search results
The Internet consists of several billion documents. Choosing information from such a great number of Web pages is not easy. We do not think that the interfaces of traditional sear...
Takumi Kobayashi, Kazuo Misue, Buntarou Shizuki, J...
ESWS
2008
Springer
13 years 11 months ago
Semantic Sitemaps: Efficient and Flexible Access to Datasets on the Semantic Web
Increasing amounts of RDF data are available on the Web for consumption by Semantic Web browsers and indexing by Semantic Web search engines. Current Semantic Web publishing practi...
Richard Cyganiak, Holger Stenzhorn, Renaud Delbru,...