Sciweavers

7065 search results - page 1090 / 1413
» Iterative Scheduling Algorithms
Sort
View
SIGMOD
1995
ACM
161views Database» more  SIGMOD 1995»
15 years 10 months ago
Applying Update Streams in a Soft Real-Time Database System
Many papers have examined how to e ciently export a materialized view but to our knowledge none have studied how to e ciently import one. To import a view, i.e., to install a stre...
Brad Adelberg, Hector Garcia-Molina, Ben Kao
AAAI
2008
15 years 9 months ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein
CDC
2008
IEEE
171views Control Systems» more  CDC 2008»
15 years 8 months ago
Subspace IDentification of MIMO LPV systems: The PBSID approach
In this paper we present a novel algorithm to identify LPV systems with affine parameter dependence operating under open and closed-loop conditions. A factorization is introduced w...
Jan-Willem van Wingerden, Michel Verhaegen
ECAI
2008
Springer
15 years 8 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
HIS
2008
15 years 8 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
« Prev « First page 1090 / 1413 Last » Next »