976 search results - page 49 / 196 » The Complexity of Timetable Construction Problems |
RECOMB
2007
Springer
14 years 11 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
STOC
2010
ACM
14 years 3 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...
PUK
2001
14 years 7 days ago
2001
The sales of customisable products and services over the internet is a challenging task within the area of electronic commerce. In this chapter we will present a case study which s...
AIPS
2009
13 years 12 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...