3946 search results - page 81 / 790 » The computational complexity of choice sets |
93
Voted
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we empirically evaluate fundamental design trade-offs among the most recent multicore processors and accelerator technologies. Our primary aim is to aid application...
84
Voted
SIGCSE
2003
ACM
15 years 5 months ago
2003
ACM
We report the results of a year-long experiment in the use of robots to teach computer science. Our data set compares results from over 800 students on identical tests from both r...
105
click to vote
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
IJAR
2007
2007
On representation and aggregation of social evaluations in computational trust and reputation models
14 years 11 months ago
Interest for computational trust and reputation models is on the rise. One of the most important aspects of these models is how they deal with information received from other indi...
91
Voted
PERCOM
2004
ACM
15 years 11 months ago
2004
ACM
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...