Sciweavers

1679 search results - page 56 / 336
» Strong order equivalence
Sort
View
STTT
2010
120views more  STTT 2010»
13 years 4 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
APAL
2008
69views more  APAL 2008»
13 years 10 months ago
Lowness properties and approximations of the jump
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
Santiago Figueira, André Nies, Frank Stepha...
VTC
2008
IEEE
107views Communications» more  VTC 2008»
14 years 4 months ago
On the Diversity Order of AF Cooperative Systems with Inter-Relay Interference Cancellation
—In this paper, we analyze a full rate cooperative communication system using amplify-and-forward (AF) two-path relaying scheme with inter-relay interference cancellation at the ...
Harya Wicaksana, See Ho Ting, Chin Keong Ho, Woon ...
APLAS
2004
ACM
14 years 3 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
AUSAI
2003
Springer
14 years 3 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar