146 search results - page 7 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
EAAI
2007
14 years 9 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
145
Voted
ICICIC
2006
IEEE
15 years 3 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
āIn this paper, we address the problem of establishing full connectivity and satisfying required trafļ¬c capacity between disconnected clusters in large wireless ad-hoc ground n...
142
click to vote
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
The problem of ļ¬nding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2āsat) is NP-complete. It generalizes the w...
MOC
2000
14 years 9 months ago
2000
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...