Sciweavers

104
Voted
KI
2013
Springer
12 years 1 months ago
Using State-Based Planning Heuristics for Partial-Order Causal-Link Planning
Abstract. We present a technique which allows partial-order causallink (POCL) planning systems to use heuristics known from state-based planning to guide their search. The techniqu...
Pascal Bercher, Thomas Geier, Susanne Biundo
INTERSPEECH
2013
12 years 1 months ago
Information retrieval-based dynamic time warping
In this paper we introduce a novel dynamic programming algorithm called Information Retrieval-based Dynamic Time Warping (IR-DTW) used to find non-linearly matching subsequences ...
Xavier Anguera
IFIP6-6
2013
44views more  IFIP6-6 2013»
12 years 1 months ago
Dynamic Resource Operation and Power Model for IP-over-WSON Networks
The power consumption of core networks is bound to grow considerably due to increasing traffic volumes. Network reconfiguration adapting resources to the load is a promising count...
Uwe Bauknecht, Frank Feller
IEEECLOUD
2013
83views more  IEEECLOUD 2013»
12 years 1 months ago
Using a Tunable Knob for Reducing Makespan of MapReduce Jobs in a Hadoop Cluster
—The MapReduce framework and its open source implementation Hadoop have become the defacto platform for scalable analysis on large data sets in recent years. One of the primary c...
Yi Yao, Jiayin Wang, Bo Sheng, Ningfang Mi
ICALP
2013
Springer
12 years 1 months ago
Exact Weight Subgraphs and the k-Sum Conjecture
Abstract. We consider the EXACT-WEIGHT-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexit...
Amir Abboud, Kevin Lewi