Sciweavers

3600 search results - page 97 / 720
» The settling-time reducibility ordering
Sort
View
KES
2004
Springer
15 years 11 months ago
Planning with Recursive Subgoals
In this paper, we introduce an effective strategy for subgoal division and ordering based upon recursive subgoals and combine this strategy with a genetic-based planning approach....
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
ICCD
2003
IEEE
104views Hardware» more  ICCD 2003»
15 years 11 months ago
Non-Crossing OBDDs for Mapping to Regular Circuit Structures
In this paper, we propose a novel compact BDD structure, called Non-crossing ordered BDD (NCOBDD), that can be mapped directly to a regular circuit structure. Compared with other ...
Aiqun Cao, Cheng-Kok Koh
ISMVL
2000
IEEE
98views Hardware» more  ISMVL 2000»
15 years 10 months ago
Implementation of Multiple-Output Functions Using PQMDDs
A sequential realization of multiple-output logic functions is presented. A conventional sequential realization is based on SBDDs (Shared reduced ordered Binary Decision Diagrams)...
Yukihiro Iguchi, Tsutomu Sasao, Munehiro Matsuura
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
15 years 10 months ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev
EURODAC
1995
IEEE
156views VHDL» more  EURODAC 1995»
15 years 9 months ago
VHDL quality: synthesizability, complexity and efficiency evaluation
With VHDL models increasing their size, it becomes more important to assure the quality of these descriptions in order to improve simulation performances, to make project maintain...
M. Mastretti