2738 search results - page 58 / 548 » The Frobenius Problem and Its Generalizations |
IJCAI
2003
13 years 10 months ago
2003
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
GECCO
2006
Springer
14 years 18 days ago
2006
Springer
The pharmaceutical industry is facing an ever-increasing demand to discover novel drugs that are more effective and safer than existing ones. The industry faces huge problem in im...
ICICIC
2006
IEEE
14 years 3 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...