Sciweavers

1855 search results - page 154 / 371
» A coding theorem for distributed computation
Sort
View
141
Voted
SAC
2004
ACM
15 years 9 months ago
A declarative framework for adaptable applications in heterogeneous environments
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
Paola Inverardi, Fabio Mancinelli, Monica Nesi
151
Voted
EUROPAR
2008
Springer
15 years 5 months ago
Transparent Mobile Middleware Integration for Java and .NET Development Environments
Developing a distributed application for mobile resource constrained devices is a difficult and error-prone task that requires awareness of several system-level details (e.g., faul...
Edgar Marques, Luís Veiga, Paulo Ferreira
89
Voted
SPAA
2000
ACM
15 years 7 months ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...
POPL
2008
ACM
16 years 3 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret