Sciweavers

13987 search results - page 769 / 2798
» The Two Guards Problem
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CAISE
2006
Springer
15 years 11 months ago
Describing Interoperability: the OoI Ontology
Abstract. Though ontologies are widely used to solve some specific interoperability problems, there is no specific ontology defining what interoperability actually is, independentl...
Yannick Naudet, Thibaud Latour, Kevin Hausmann, Sv...
EWCBR
2004
Springer
15 years 11 months ago
MINLP Based Retrieval of Generalized Cases
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
Alexander Tartakovski, Martin Schaaf, Rainer Maxim...
ECML
2006
Springer
15 years 11 months ago
Active Learning with Irrelevant Examples
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
Dominic Mazzoni, Kiri Wagstaff, Michael C. Burl
HIPC
2000
Springer
15 years 11 months ago
Memory Consistency and Process Coordination for SPARC Multiprocessors
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
Lisa Higham, Jalal Kawash