Sciweavers

50 search results - page 10 / 10
» An Approach for Modeling the Name Lookup Problem in the C ...
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
12 years 11 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
CP
2007
Springer
13 years 11 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
SIGMOD
2011
ACM
158views Database» more  SIGMOD 2011»
12 years 7 months ago
Workload-aware database monitoring and consolidation
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 producti...
Carlo Curino, Evan P. C. Jones, Samuel Madden, Har...
JPDC
2000
141views more  JPDC 2000»
13 years 4 months ago
A System for Evaluating Performance and Cost of SIMD Array Designs
: SIMD arrays are likely to become increasingly important as coprocessors in domain specific systems as architects continue to leverage RAM technology in their design. The problem ...
Martin C. Herbordt, Jade Cravy, Renoy Sam, Owais K...
ICALP
2004
Springer
13 years 10 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee