3221 search results - page 213 / 645 » Termination of Linear Programs |
279
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
150
click to vote
ICMCS
2005
IEEE
16 years 16 hour ago
2005
IEEE
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
168
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
278
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
160
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...