3433 search results - page 532 / 687 » Heuristics for a bidding problem |
165
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
167
click to vote
PLDI
1995
ACM
15 years 10 months ago
1995
ACM
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...
204
click to vote
ANCS
2008
ACM
15 years 8 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
188
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
164
click to vote
ICONIP
2007
15 years 8 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...