3946 search results - page 29 / 790 » The computational complexity of choice sets |
ICTAI
2008
IEEE
15 years 6 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
100
click to vote
EUSFLAT
2009
14 years 9 months ago
2009
Consideration sets provide a standard tool for the exploration of consumer choice. It is appropriate to analyze it as a fuzzy set because not all the brands of a certain category o...
SIBGRAPI
2006
IEEE
15 years 5 months ago
2006
IEEE
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
102
click to vote
ACSC
2003
IEEE
15 years 3 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...