504 search results - page 80 / 101 » The Complexity of Symmetry-Breaking Formulas |
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
RTAS
2005
IEEE
14 years 3 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
EPIA
2005
Springer
14 years 3 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
TACAS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
DATE
2002
IEEE
14 years 3 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...