890 search results - page 79 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
145
click to vote
DATE
2008
IEEE
16 years 23 days ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
167
click to vote
KDD
1995
ACM
15 years 9 months ago
1995
ACM
The Bayesianclassifier is a simple approachto classification that producesresults that are easy for people to interpret. In many cases, the Bayesianclassifieris at leastasaccurate...
168
click to vote
TPDS
2008
15 years 6 months ago
2008
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
179
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
154
click to vote
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
15 years 6 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...