3134 search results - page 145 / 627 » Computing full disjunctions |
137
click to vote
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
138
click to vote
ICRA
2000
IEEE
15 years 8 months ago
2000
IEEE
Force feedback coupled with a real-time physically realistic graphic display provides a human operator with an artificial sense of presence in a virtual environment. Furthermore,...
121
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
103
Voted
IJCAI
2007
15 years 5 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
147
click to vote
AAAI
2006
15 years 5 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...