1557 search results - page 263 / 312 » Programming up to Congruence |
PLDI
2003
ACM
15 years 4 months 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...
ATAL
2003
Springer
15 years 4 months ago
2003
Springer
Research in multi-agent systems has led to the development of many multi-agent control architectures. However, we believe that there is currently no known optimal structure for mu...
DAGM
2003
Springer
15 years 4 months ago
2003
Springer
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
107
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
133
click to vote
ICALP
2001
Springer
15 years 3 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...