1581 search results - page 215 / 317 » Domain semantics of possibility computations |
123
click to vote
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
The development of many complex simulation applications requires collaborative effort from researchers with different domain knowledge and expertise, possibly at different locatio...
111
click to vote
CSE
2008
IEEE
15 years 2 months ago
2008
IEEE
A well-known challenge during processor design is to obtain best possible results for a typical target application domain by combining flexibility and computational performance. A...
CORR
2010
Springer
15 years 23 days ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
101
Voted
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
75
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
This paper addresses the question of factoring a logic into families of (generally simpler) components, estimating the top– down perspective, splitting, versus the bottom–up, s...