Sciweavers

4480 search results - page 816 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
RTCSA
2003
IEEE
15 years 11 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
RTSS
2003
IEEE
15 years 11 months ago
Contention-Free Periodic Message Scheduler Medium Access Control in Wireless Sensor / Actuator Networks
This paper presents a time division multiple access medium access control protocol for wireless sensor / actuator networks implemented with a contention-free message scheduler. A ...
Thomas W. Carley, Moussa A. Ba, Rajeev Barua, Davi...
FASE
2010
Springer
15 years 9 months ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...
JUCS
2008
134views more  JUCS 2008»
15 years 6 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 6 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro