3946 search results - page 370 / 790 » The computational complexity of choice sets |
233
click to vote
ACL
2010
15 years 5 months ago
2010
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
209
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we introduce a novel approach to single view reconstruction using shape grammars. Our approach consists in modeling architectural styles using a set of basic shapes ...
208
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
219
click to vote
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
15 years 1 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
191
click to vote
ICEBE
2007
IEEE
16 years 1 months ago
2007
IEEE
Nowadays, there are a number of similar web services over the internet or intranet. They provide consumers with more choices according to their personalized QoS requirements. Howe...