2398 search results - page 105 / 480 » Constraint Programming and Graph Algorithms |
126
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
151
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
139
click to vote
LCTRTS
2007
Springer
15 years 11 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
303
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
144
click to vote
RISE
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...