Sciweavers

192 search results - page 36 / 39
» concurrency 2002
Sort
View
TRIER
2002
14 years 10 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
15 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
VRCAI
2004
ACM
15 years 3 months ago
Explorative construction of virtual worlds: an interactive kernel approach
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...
Jinseok Seo, Gerard Jounghyun Kim
ACSC
2002
IEEE
15 years 3 months ago
Intelligent Agents for Automated One-to-Many e-Commerce Negotiation
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
Iyad Rahwan, Ryszard Kowalczyk, H. H. Pham
COOPIS
2002
IEEE
15 years 3 months ago
Design and Performance of Asynchronous Method Handling for CORBA
This paper describes the design and performance of a new asynchronous method handling (AMH) mechanism that allows CORBA servers to process client requests asynchronously. AMH deco...
Mayur Deshpande, Douglas C. Schmidt, Carlos O'Ryan...