1686 search results - page 158 / 338 » Programs as polygraphs: computability and complexity |
131
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
122
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
146
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
123
Voted
SAC
2003
ACM
15 years 9 months ago
2003
ACM
As the use of XML is rapidly growing, a growing number of users without programming skills will need to query XML data. Although designed to be easily understood by humans, XQuery...
113
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...