Sciweavers

118 search results - page 15 / 24
» Transforming Out Timing Leaks
Sort
View
BIRTHDAY
2005
Springer
14 years 2 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICDE
2010
IEEE
186views Database» more  ICDE 2010»
14 years 8 months ago
Mini-Me: A Min-Repro System for Database Software
Testing and debugging database software is often challenging and time consuming. A very arduous task for DB testers is finding a min-repro ? the "simplest possible setup"...
Nicolas Bruno, Rimma V. Nehme
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
ESOP
1999
Springer
14 years 26 days ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller