Sciweavers

8413 search results - page 299 / 1683
» Ordering Problem Subgoals
Sort
View
GECCO
2007
Springer
148views Optimization» more  GECCO 2007»
16 years 21 days ago
Exploring the behavior of building blocks for multi-objective variation operator design using predator-prey dynamics
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
Christian Grimme, Joachim Lepping, Alexander Papas...
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
16 years 19 days ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
EVOW
2005
Springer
16 years 2 days ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling
FCT
2001
Springer
15 years 11 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
VLDB
2001
ACM
90views Database» more  VLDB 2001»
15 years 11 months ago
Update Propagation Strategies for Improving the Quality of Data on the Web
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
Alexandros Labrinidis, Nick Roussopoulos