146 search results - page 10 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
FUIN
2010
14 years 10 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
MOR
2008
14 years 11 months ago
2008
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
114
Voted
TSMC
2010
14 years 6 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...