522 search results - page 23 / 105 » On the Hardness of the Noncommutative Determinant |
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
ICSE
2009
IEEE-ACM
14 years 2 months ago
2009
IEEE-ACM
Determining whether a set of features can be composed, or safe composition, is a hard problem in software product line engineering because the number of feature combinations can b...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...