2109 search results - page 305 / 422 » Solving Necklace Constraint Problems |
143
click to vote
PUK
2001
15 years 6 months ago
2001
The work described in this paper presents an approach on scheduling in a virtual enterprise in the tourism sector. This scheduling scenario has to reconcile customers' and ser...
146
click to vote
IVA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
179
Voted
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 8 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
126
click to vote
CVPR
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
125
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...