117 search results - page 6 / 24 » Characterization of polyhedron monotonicity |
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
JAIR
2006
14 years 9 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
IPMU
2010
Springer
14 years 8 months ago
2010
Springer
A class of extended aggregation operators, called impact functions, is proposed and their basic properties are examined. Some important classes of functions like generalized ordere...
107
click to vote
RTAS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...