4679 search results - page 601 / 936 » Modeling When Connections Are the Problem |
176
click to vote
ATAL
2005
Springer
16 years 2 days ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
188
click to vote
ANSS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...
206
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Microarray experiments measure changes in the expression of thousands of genes. The resulting lists of genes with changes in expression are then searched for biologica...
180
click to vote
CP
2007
Springer
16 years 24 days ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
257
click to vote
PKC
2011
Springer
14 years 9 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...