Sciweavers

505 search results - page 78 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
CI
2011
93views more  CI 2011»
14 years 6 months ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...
DATE
2007
IEEE
126views Hardware» more  DATE 2007»
15 years 6 months ago
The ARTEMIS cross-domain architecture for embedded systems
platform and a suite of abstract components with which new developments in different application domains can be engineered with minimal effort [1]p.16. Generic platforms, or refere...
Hermann Kopetz
DMSN
2009
ACM
15 years 6 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
INFOCOM
2003
IEEE
15 years 5 months ago
Integrating effective-bandwidth-based QoS routing and best effort routing
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...
Stephen L. Spitler, Daniel C. Lee
RTSS
1998
IEEE
15 years 4 months ago
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
Ray-I Chang, Wei Kuan Shih, Ruei-Chuan Chang