Sciweavers

221 search results - page 25 / 45
» Analyzing the Implicit Computational Complexity of object-or...
Sort
View
AAAI
2010
15 years 3 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
96
Voted
SAS
2001
Springer
15 years 6 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
ICFP
2008
ACM
16 years 1 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy
94
Voted
AAAI
1994
15 years 3 months ago
Representing Multiple Theories
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
P. Pandurang Nayak
100
Voted
CP
2007
Springer
15 years 8 months ago
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...