Sciweavers

43264 search results - page 8208 / 8653
» Comparing models of computation
Sort
View
APN
2010
Springer
15 years 8 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
129
Voted
CPAIOR
2010
Springer
15 years 8 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi
141
Voted
ECOOP
2010
Springer
15 years 8 months ago
Correct Refactoring of Concurrent Java Code
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurren...
Max Schäfer, Julian Dolby, Manu Sridharan, Em...
128
Voted
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 8 months ago
Christmas Gift Exchange Games
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, ac...
Arpita Ghosh, Mohammad Mahdian
106
Voted
CLUSTER
2009
IEEE
15 years 8 months ago
Finding a tradeoff between host interrupt load and MPI latency over Ethernet
—Achieving high-performance message passing on top of generic ETHERNET hardware suffers from the NIC interruptdriven model where coalescing is usually involved. We present an in-...
Brice Goglin, Nathalie Furmento
« Prev « First page 8208 / 8653 Last » Next »