Sciweavers

8728 search results - page 401 / 1746
» On Reduct Construction Algorithms
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
15 years 8 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
TWC
2008
187views more  TWC 2008»
15 years 6 months ago
Peak restoration in ofdm receiver with clipping a/d converter
OFDM signals suffer from a large Peak to Average Power Ratio, which requires large power back-offs in the transmit and receive chains. This paper studies two digital postprocessing...
Ronald Rietman, Jean-Paul M. G. Linnartz
LPAR
2010
Springer
15 years 4 months ago
SAT Encoding of Unification in EL
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
Franz Baader, Barbara Morawska
ICONS
2009
IEEE
15 years 4 months ago
Improving the Sensitivity of Deadlines with a Specific Asynchronous Scenario for Harmonic Periodic Tasks scheduled by FP
The aim of this paper is to address the problem of correctly dimensioning real-time embedded systems. It is well known that computers which control systems are greatly affected by...
Patrick Meumeu Yomsi, Yves Sorel, D. de Rauglaudre...