Sciweavers

18306 search results - page 505 / 3662
» Algorithmics in Exponential Time
Sort
View
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
16 years 2 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
EOR
2008
52views more  EOR 2008»
15 years 7 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
16 years 2 months ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...
EDBT
2010
ACM
184views Database» more  EDBT 2010»
16 years 2 months ago
Aggregation of asynchronous electric power consumption time series knowing the integral
More and more data mining algorithms are applied to a large number of long time series issued by many distributed sensors. The consequence of the huge volume of data is that data ...
Raja Chiky, Laurent Decreusefond, Georges Hé...
ICPADS
2008
IEEE
16 years 2 months ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu