Sciweavers

382 search results - page 47 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
126
Voted
ICFP
2003
ACM
16 years 2 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
119
Voted
CDB
2004
Springer
158views Database» more  CDB 2004»
15 years 6 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
111
Voted
ICALP
2000
Springer
15 years 6 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
126
Voted
CGO
2005
IEEE
15 years 8 months ago
Compiler Managed Dynamic Instruction Placement in a Low-Power Code Cache
Modern embedded microprocessors use low power on-chip memories called scratch-pad memories to store frequently executed instructions and data. Unlike traditional caches, scratch-p...
Rajiv A. Ravindran, Pracheeti D. Nagarkar, Ganesh ...
161
Voted
FUIN
2007
135views more  FUIN 2007»
15 years 2 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner