Sciweavers

1920 search results - page 212 / 384
» The Complexity of the A B C Problem
Sort
View
CASES
2008
ACM
15 years 8 months ago
Multi-granularity sampling for simulating concurrent heterogeneous applications
Detailed or cycle-accurate/bit-accurate (CABA) simulation is a critical phase in the design flow of embedded systems. However, with increasing system complexity, full detailed sim...
Melhem Tawk, Khaled Z. Ibrahim, Smaïl Niar
CASES
2005
ACM
15 years 8 months ago
Exploring the design space of LUT-based transparent accelerators
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
Sami Yehia, Nathan Clark, Scott A. Mahlke, Kriszti...
SDM
2010
SIAM
256views Data Mining» more  SDM 2010»
15 years 8 months ago
The Application of Statistical Relational Learning to a Database of Criminal and Terrorist Activity
We apply statistical relational learning to a database of criminal and terrorist activity to predict attributes and event outcomes. The database stems from a collection of news ar...
B. Delaney, Andrew S. Fast, W. M. Campbell, C. J. ...
ECAL
2005
Springer
15 years 12 months ago
The Quantitative Law of Effect is a Robust Emergent Property of an Evolutionary Algorithm for Reinforcement Learning
An evolutionary reinforcement-learning algorithm, the operation of which was not associated with an optimality condition, was instantiated in an artificial organism. The algorithm ...
J. J. McDowell, Zahra Ansari
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
16 years 6 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd