117 search results - page 8 / 24 » Characterization of polyhedron monotonicity |
103
click to vote
APN
2009
Springer
15 years 4 months ago
2009
Springer
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given Quality of Service (QoS...
ICIP
2009
IEEE
15 years 11 months ago
2009
IEEE
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...