1199 search results - page 28 / 240 » Parameterized Proof Complexity |
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
KBSE
2000
IEEE
14 years 6 days ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
RTAS
2005
IEEE
14 years 2 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 ...
CSL
2000
Springer
14 years 1 months ago
2000
Springer
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
SIAMCOMP
2000
13 years 8 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...