13603 search results - page 2711 / 2721 » On the Computational Complexity of Cut-Reduction |
GECCO
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
IDEAL
2003
Springer
14 years 17 days ago
2003
Springer
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
AGP
2010
IEEE
14 years 14 days ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
ISCA
2010
IEEE
14 years 14 days ago
2010
IEEE
Continued device scaling enables microprocessors and other systems-on-chip (SoCs) to increase their performance, functionality, and hence, complexity. Simultaneously, relentless s...