393 search results - page 30 / 79 » The LCA Problem Revisited |
135
click to vote
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
107
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
126
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
114
click to vote
ISPW
2006
IEEE
15 years 8 months ago
2006
IEEE
In order to help knowledge acquirement and accumulation from past experiences, we propose a KFC (Knowledge Feedback Cycle) framework among engineers and researchers. Three tools (E...
123
click to vote
CEC
2005
IEEE
15 years 7 months ago
2005
IEEE
The XCS Learning Classifier System has traditionally used roulette wheel selection within its genetic algorithm component. Recently, tournament selection has been suggested as prov...