570 search results - page 34 / 114 » The Complexity of Reasoning with Global Constraints |
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
75
Voted
TCAD
2008
14 years 9 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
176
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
DLOG
2010
14 years 7 months ago
2010
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...