Sciweavers

995 search results - page 24 / 199
» Wire-speed total order
Sort
View
FLAIRS
2004
15 years 1 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 10 months ago
On Outage and Error Rate Analysis of the Ordered V-BLAST
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
Sergey Loyka, François Gagnon
ECSQARU
2009
Springer
15 years 6 months ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
OPODIS
2008
15 years 1 months ago
Ordering-Based Semantics for Software Transactional Memory
It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve...
Michael F. Spear, Luke Dalessandro, Virendra J. Ma...
CGO
2009
IEEE
15 years 6 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...