890 search results - page 63 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
151
click to vote
IPPS
2007
IEEE
16 years 15 days ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
184
click to vote
CEC
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract— Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic...
144
click to vote
UAI
2001
15 years 7 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
167
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
146
click to vote
PATAT
2000
Springer
15 years 9 months ago
2000
Springer
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...