Sciweavers

1204 search results - page 193 / 241
» Termination of Polynomial Programs
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
ISQED
2010
IEEE
177views Hardware» more  ISQED 2010»
15 years 4 months ago
Multi-corner, energy-delay optimized, NBTI-aware flip-flop design
With the CMOS transistors being scaled to sub 45nm and lower, Negative Bias Temperature Instability (NBTI) has become a major concern due to its impact on PMOS transistor aging pr...
Hamed Abrishami, Safar Hatami, Massoud Pedram
CADE
2009
Springer
15 years 4 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer
IEEECGIV
2009
IEEE
15 years 4 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen