807 search results - page 42 / 162 » Competition Adds Complexity |
VISSOFT
2005
IEEE
15 years 3 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
SIGCSE
2005
ACM
15 years 3 months ago
2005
ACM
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
Aspect-oriented programming (AOP) is a promising field for reducing application complexity. However, it has proven difficult to implement weavers for general purpose languages. Nev...
100
click to vote
XSYM
2005
Springer
15 years 3 months ago
2005
Springer
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and a...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents an algorithm for learning the meaning of messages communicated between agents that interact while acting optimally towards a cooperative goal. Our reinforcemen...