34170 search results - page 515 / 6834 » Optimization |
182
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
179
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
152
click to vote
AAAI
2008
15 years 9 months ago
2008
Adopting a decision-theoretic perspective, we investigate the problem of optimal testing of structured knowledge
219
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. There has been an increased interest in recent years to incorporate uncertainty in Description Logics (DLs), and a number of proposals have been put forward for modeling ...
184
click to vote
WSC
2007
15 years 9 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...