3838 search results - page 238 / 768 » Techniques for Optimization of Net Algorithms |
136
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ļ¬...
147
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
This paper explores some simple evolutionary strategies for an elitist, steady-state Pareto-based multi-objective evolutionary algorithm. The experimental framework is based on the...
120
Voted
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
Borodin, Nielsen and Rackoļ¬ [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
121
click to vote
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
123
Voted
PDPTA
2007
15 years 6 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet speciļ¬c availability and capacity requirements. We show that the problem of ļ¬nd...