9842 search results - page 1708 / 1969 » The Complexity of the Matching-Cut Problem |
138
click to vote
GMP
2006
IEEE
15 years 10 months ago
2006
IEEE
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
143
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
134
click to vote
WSE
2006
IEEE
15 years 10 months ago
2006
IEEE
For web applications, determining how requests from a web page are routed through server components can be time-consuming and error-prone due to the complex set of rules and mecha...
135
click to vote
ASPLOS
2006
ACM
15 years 10 months ago
2006
ACM
While the number of transistors on a chip increases exponentially over time, the productivity that can be realized from these systems has not kept pace. To deal with the complexit...
135
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...