182 search results - page 27 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
80
Voted
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
137
click to vote
ICAL
2011
13 years 9 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
CPAIOR
2009
Springer
15 years 4 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 ...
TCOM
2010
14 years 7 months ago
2010
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...