Sciweavers

2006 search results - page 59 / 402
» Heuristic Security-Testing Methods
Sort
View
CEC
2009
IEEE
15 years 5 months ago
Examination timetabling using late acceptance hyper-heuristics
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...
Ender Özcan, Yuri Bykov, Murat Birben, Edmund...
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 10 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
TKDE
1998
100views more  TKDE 1998»
14 years 10 months ago
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
E cient storage and retrieval of multi-attribute datasets have become one of the essential requirements for many data-intensive applications. The Cartesian product le has been kno...
Bongki Moon, Joel H. Saltz
86
Voted
IJCAI
2001
15 years 13 days ago
Keyword Spices: A New Method for Building Domain-Specific Web Search Engines
This paper presents a new method for building domain-specific web search engines. Previous methods eliminate irrelevant documents from the pages accessed using heuristics based on...
Satoshi Oyama, Takashi Kokubo, Toru Ishida, Teruhi...
IEAAIE
2001
Springer
15 years 3 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...