Titlebook: Automata, Languages and Programming; 29th International C Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy Conference proceedings 2002 Spr

Expostulate

Molecular Assembly and Computation: From Theory to Experimental Demonstrationsomputer science with the development of its theoretical basis and a number of moderate to large-scale experimental demonstrations. This paper focuses on a subarea of Molecular Computation known as . Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the se

Delectable

Towards a Predictive Computational Complexity Theorycterizing the computational complexity of combinatorial problems. However, due to their generality, these concepts have inherent limitations - they typically ignore the underlying structure and semantics of the problem instances. Thus they are generally not “robust” in terms of simultaneously classi

prick-test

L(A) = L(B)? Decidability Results from Complete Formal Systemsproblem for deterministic pushdown automata: Given two languages .. and .. accepted by deterministic pushdown automata decide whether ..=... The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained el

環(huán)形

Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsData mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open proble

腐敗

Program Debugging and Validation Using Semantic Approximations and Partial Specificationshe semantic approximations produced by such analyses have been traditionally applied to . during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program . and . [.,.,.].

Hectic

Inapproximability Results for Equations over Finite Groupsquation is . if there is a setting of the variables to values in . so that the equality is realized. We study the problem of simultaneously satisfying a family of equations over a finite group . and show that it is .-hard to approximate the number of simultaneously satisfiable equations to within |.

Carminative

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphsin .. log log .) time, where . and . are the number of edges & vertices, respectively. This is strictly faster than Johnson’s algorithm (for arbitrary edge-weights) and Dijkstra’s algorithm (for positive edge-weights) when . = .(. log .) and matches the running time of Hagerup’s APSP algorithm, whic

cruise

大罵

Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internettsos, and Faloutsos, SIGCOMM 1999] based on a toy model of Internet growth in which two objectives are optimized simultaneously: “l(fā)ast mile” connection costs, and transmission delays measured in hops. We also point out a similar phenomenon, anticipated in [.], in the distribution of file sizes. Our

Verify

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game consisting of . parallel . We assume a collection of ., each employing a ., which is a probability distribution over links, to control the routing of its own assigned . In a ., each user selfishly routes its traffic on those links that minimize its ., given the network congestion caused by the othe