890 search results - page 39 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
119
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
131
click to vote
TON
2010
14 years 8 months ago
2010
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
103
click to vote
JAL
2008
15 years 1 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
154
click to vote
ARITH
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...