315 search results - page 52 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
124
click to vote
INFOCOM
2010
IEEE
15 years 9 days ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
145
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 6 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
143
click to vote
ISBRA
2009
Springer
15 years 8 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
128
click to vote
GECCO
2006
Springer
15 years 5 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...
116
click to vote
IJCAI
1989
15 years 3 months ago
1989
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...