Sciweavers

1086 search results - page 89 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
PPDP
2010
Springer
15 years 4 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
RTAS
1998
IEEE
15 years 10 months ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 11 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
16 years 18 days ago
Hilbert transformers with a piecewise-polynomial-sinusoidal impulse response
— Hilbert transformers are one of the very important special classes of finite impulse response (FIR) filters used in signal processing applications. A method is presented to s...
Raija Lehto, Tapio Saramäki, Olli Vainio
DC
2010
15 years 6 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh