3591 search results - page 207 / 719 » Typing linear constraints |
225
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
201
click to vote
MUM
2009
ACM
16 years 1 months ago
2009
ACM
There are academic and commercial drivers for contextawareness to play a prominent role in the future of mobile services. Implementing a complete model of context remains an unsol...
156
Voted
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
177
click to vote
PLDI
2004
ACM
16 years 16 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
164
Voted
EUSFLAT
2007
15 years 8 months ago
2007
Computation with information described in natural language (NL) has intrinsic importance because much of human knowledge is described using these languages. Soft Computing approac...