Sciweavers

562 search results - page 50 / 113
» Concurrent Turing Machines
Sort
View
NC
2011
219views Neural Networks» more  NC 2011»
14 years 2 months ago
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
Paolo Bottoni, Anna Labella, Florin Manea, Victor ...
DNA
2007
Springer
176views Bioinformatics» more  DNA 2007»
15 years 6 months ago
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ib...
ICEBE
2007
IEEE
115views Business» more  ICEBE 2007»
15 years 6 months ago
A Concurrent G-Negotiation Mechanism for Grid Resource Co-allocation
Since computationally intensive applications may often require more resources than a single computing machine can provide in one administrative domain, bolstering resource co-allo...
Benyun Shi, Kwang Mong Sim
SIGMOD
1995
ACM
132views Database» more  SIGMOD 1995»
15 years 3 months ago
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines whil...
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Ma...
INTERNET
2006
149views more  INTERNET 2006»
14 years 11 months ago
Concurrent Multiple-Issue Negotiation for Internet-Based Services
Negotiation is a technique for reaching mutually beneficial agreement among autonomous entities. A concurrent negotiation problem occurs when one entity is negotiating simultaneous...
Jiangbo Dang, Michael N. Huhns