Sciweavers

836 search results - page 80 / 168
» On the Complexity of Train Assignment Problems
Sort
View
INFOCOM
2005
IEEE
15 years 9 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
ICPR
2002
IEEE
16 years 5 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
SC
2000
ACM
15 years 8 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout
ICS
2004
Tsinghua U.
15 years 9 months ago
CQoS: a framework for enabling QoS in shared caches of CMP platforms
Cache hierarchies have been traditionally designed for usage by a single application, thread or core. As multi-threaded (MT) and multi-core (CMP) platform architectures emerge and...
Ravi R. Iyer
RTSS
1992
IEEE
15 years 8 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin