555 search results - page 101 / 111 » Complexity of Operations on Cofinite Languages |
CIKM
2004
Springer
14 years 27 days ago
2004
Springer
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
PLDI
2003
ACM
14 years 22 days ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
HOTSWUP
2009
ACM
14 years 5 days ago
2009
ACM
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
IFIP
2001
Springer
13 years 12 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
EMSOFT
2009
Springer
13 years 11 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...