721 search results - page 18 / 145 » On Generators of Random Quasigroup Problems |
112
click to vote
EOR
2010
14 years 12 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
106
click to vote
SPIN
2010
Springer
14 years 10 months ago
2010
Springer
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
EVOW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...