Sciweavers

1525 search results - page 18 / 305
» POSD-a notation for presenting complex systems of processes
Sort
View
IANDC
2010
79views more  IANDC 2010»
14 years 10 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 12 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
FOCS
1998
IEEE
15 years 4 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
JSW
2007
97views more  JSW 2007»
14 years 11 months ago
Instantiation of a Classification System Framework that Facilitates Reuse
Abstract—Frameworks are a key technology to reduce software development costs and shorten the time-to-market. However, framework complexity presents reuse problems that limit its...
Sérgio F. Lopes, Adriano Tavares, Joã...
CORR
2006
Springer
193views Education» more  CORR 2006»
14 years 11 months ago
On the Design of Agent-Based Systems using UML and Extensions
The Unified Software Development Process (USDP) and Unified Modeling Language (UML) have been now generally accepted as the standard methodology and modeling language for developin...
Mihaela Dinsoreanu, Ioan Salomie, Kalman Pusztai