3433 search results - page 411 / 687 » Heuristics for a bidding problem |
157
click to vote
ICPADS
2005
IEEE
16 years 11 days ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
176
click to vote
LCN
2005
IEEE
16 years 11 days ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
153
click to vote
ICALP
2005
Springer
16 years 9 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
151
click to vote
ECAI
2004
Springer
16 years 5 days ago
2004
Springer
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
197
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...