Sciweavers

12052 search results - page 272 / 2411
» computer 2010
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 12 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
SIGECOM
2010
ACM
161views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Computation and incentives in combinatorial public projects
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Dave Buchfuhrer, Michael Schapira, Yaron Singer
ISPEC
2010
Springer
15 years 10 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
JUCS
2010
113views more  JUCS 2010»
14 years 12 months ago
Isometries and Computability Structures
: We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent ...
Zvonko Iljazovic
EL
2002
181views more  EL 2002»
15 years 5 months ago
Aspects of networking in multiplayer computer games
Distributed, real-time multiplayer computer games (MCGs) are in the vanguard of utilizing the networking possibilities. Although related research have been done in military simulat...
Jouni Smed, Timo Kaukoranta, Harri Hakonen