Sciweavers

146 search results - page 25 / 30
» Recurrent Subgraph Prediction
Sort
View
MST
2007
154views more  MST 2007»
13 years 9 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
ECRTS
2009
IEEE
13 years 7 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
ICMLA
2009
13 years 7 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
CJ
2010
134views more  CJ 2010»
13 years 7 months ago
Designing Effective Policies for Minimal Agents
A policy for a minimal reactive agent is a set of condition-action rules used to determine its response to perceived environmental stimuli. When the policy pre-disposes the agent t...
Krysia Broda, Christopher J. Hogger
MICRO
2002
IEEE
131views Hardware» more  MICRO 2002»
14 years 2 months ago
Pointer cache assisted prefetching
Data prefetching effectively reduces the negative effects of long load latencies on the performance of modern processors. Hardware prefetchers employ hardware structures to predic...
Jamison D. Collins, Suleyman Sair, Brad Calder, De...