6456 search results - page 954 / 1292 » Constraint Solving on Terms |
184
click to vote
LPAR
2004
Springer
16 years 2 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
296
click to vote
UPP
2004
Springer
16 years 2 days ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
188
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
172
click to vote
SIGCOMM
2003
ACM
15 years 12 months ago
2003
ACM
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
152
Voted
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...