4524 search results - page 344 / 905 » The Complexity of Global Constraints |
188
click to vote
ICML
2004
IEEE
16 years 9 days ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
157
click to vote
EAI
2004
15 years 8 months ago
2004
Abstract: Web services are increasingly used to integrate heterogeneous and autonomous applications in cross-organizational cooperations. A key problem is to support a high executi...
175
click to vote
WSCG
2001
15 years 8 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
161
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
170
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...