Sciweavers

3600 search results - page 44 / 720
» The settling-time reducibility ordering
Sort
View
EOR
2008
91views more  EOR 2008»
13 years 7 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
DAC
2002
ACM
14 years 8 months ago
Model order reduction for strictly passive and causal distributed systems
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
Luca Daniel, Joel R. Phillips
DAC
2002
ACM
14 years 8 months ago
Guaranteed passive balancing transformations for model order reduction
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the mod...
Joel R. Phillips, Luca Daniel, Luis Miguel Silveir...
PDCAT
2004
Springer
14 years 1 months ago
An In-Order SMT Architecture with Static Resource Partitioning for Consumer Applications
Abstract. This paper proposes a simplified simultaneous multithreading (SMT) architecture aiming at CPU cores of embedded SoCs for consumer applications. This architecture reduces...
Byung In Moon, Hongil Yoon, Ilgun Yun, Sungho Kang
CIE
2009
Springer
14 years 2 months ago
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Manuel Bodirsky, Miki Hermann, Florian Richoux