10718 search results - page 359 / 2144 » On the Circuit Implementation Problem |
214
click to vote
IOR
2011
15 years 1 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
172
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
188
click to vote
LPNMR
2007
Springer
16 years 28 days ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
232
click to vote
TAINN
2005
Springer
16 years 8 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
168
click to vote
MP
2008
15 years 6 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...