4451 search results - page 306 / 891 » On Random Ordering Constraints |
169
Voted
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
131
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
170
click to vote
MICRO
1996
IEEE
15 years 11 months ago
1996
IEEE
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
206
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
171
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...