Sciweavers

1968 search results - page 297 / 394
» The Complexity of Valued Constraint Models
Sort
View
RTSS
2002
IEEE
15 years 2 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
BDA
2004
14 years 11 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...
WSC
2000
14 years 11 months ago
Enterprise Simulation: framework for a strategic application
The term Enterprise Simulation (ES) is gaining acceptance among simulation practitioners. It is coming to represent certain tangible attributes, and its benefits seem apparent in ...
Milind M. Datar
AI
2008
Springer
14 years 10 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
COGSCI
2006
127views more  COGSCI 2006»
14 years 10 months ago
Decision Making and Confidence Given Uncertain Advice
We study human decision making in a simple forced-choice task that manipulates the frequency and accuracy of available information. Empirically, we find that people make decisions...
Michael D. Lee, Matthew J. Dry