Sciweavers

8486 search results - page 96 / 1698
» Ordered Enumeration Method
Sort
View
DATE
2008
IEEE
137views Hardware» more  DATE 2008»
14 years 3 months ago
SPARE - a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction
In this paper we describe a flexible and efficient new algorithm for model order reduction of parameterized systems. The method is based on the reformulation of the parametric s...
Jorge Fernandez Villena, Luis Miguel Silveira
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
14 years 2 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
FLAIRS
2003
13 years 10 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
JCNS
2010
100views more  JCNS 2010»
13 years 7 months ago
Morphologically accurate reduced order modeling of spiking neurons
Accurately simulating neurons with realistic morphological structure and synaptic inputs requires the solution of large systems of nonlinear ordinary differential equations. We ap...
Anthony R. Kellems, Saifon Chaturantabut, Danny C....
RTA
2009
Springer
14 years 3 months ago
Dependency Pairs and Polynomial Path Orders
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Martin Avanzini, Georg Moser