10718 search results - page 704 / 2144 » On the Circuit Implementation Problem |
222
click to vote
ICFP
2007
ACM
16 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
188
click to vote
FUIN
2008
15 years 7 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
249
click to vote
KDD
2007
ACM
16 years 8 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
310
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
162
click to vote
CDC
2008
IEEE
16 years 2 months ago
2008
IEEE
— The practical implementation of Min-Max MPC (MMMPC) controllers is limited by the computational burden required to compute the control law. This problem can be circumvented by ...