4451 search results - page 159 / 891 » On Random Ordering Constraints |
242
click to vote
SIGAL
1990
15 years 9 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
151
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
167
click to vote
TCOM
2008
15 years 4 months ago
2008
Abstract--Incremental-redundancy hybrid automatic repeatrequest (IR-HARQ) schemes are proposed in several wireless standards for increased throughput-efficiency and greater reliabi...
202
click to vote
TVLSI
2010
14 years 11 months ago
2010
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
141
Voted
PODS
2003
ACM
16 years 5 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...