4524 search results - page 71 / 905 » The Complexity of Global Constraints |
DAGSTUHL
2006
15 years 1 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
105
Voted
CONSTRAINTS
1998
15 years 7 days ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
127
Voted
TABLEAUX
2009
Springer
15 years 7 months ago
2009
Springer
We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved thr...
87
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
113
Voted
ESANN
2007
15 years 2 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...