4451 search results - page 206 / 891 » On Random Ordering Constraints |
165
Voted
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
172
Voted
DAC
2000
ACM
15 years 10 months ago
2000
ACM
The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorpl...
168
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many symmetry breaking methods have been proposed so far. Previous works have shown that these methods could be combined together under some conditions. We use a different angle :...
142
click to vote
AAAI
2007
15 years 8 months ago
2007
In the last decade, several approaches have been proposed for merging multiple and potentially conflicting pieces of information. Egalitarist fusion modes privilege solutions tha...
143
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...