513 search results - page 57 / 103 » Reduction Transformations in ORM |
132
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
176
click to vote
EURODAC
1995
IEEE
15 years 7 months ago
1995
IEEE
The paper presents an approach for performance and complexity analysis of hardware/software implementations for real-time systems on every stage of the partitioning. There are two...
132
click to vote
AHS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a multi-objective algorithm for on-line adaptation of a multi-carrier code-division multiple access (MC-CDMA) receiver. A specially tailored Genetic Algorithm ...
116
click to vote
CCCG
2003
15 years 5 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
117
click to vote
ANLP
2000
15 years 5 months ago
2000
Arabic inflectional morphology requires infixation, prefixation and suffixation, giving rise to a large space of morphological variation. In this paper we describe an approach to ...