3433 search results - page 279 / 687 » Heuristics for a bidding problem |
159
click to vote
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
165
click to vote
AI
1998
Springer
15 years 11 months ago
1998
Springer
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
164
click to vote
ECP
1997
Springer
15 years 11 months ago
1997
Springer
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
147
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
172
click to vote
AIPS
2000
15 years 8 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...