3946 search results - page 114 / 790 » The computational complexity of choice sets |
173
click to vote
HUC
2004
Springer
15 years 12 months ago
2004
Springer
As ubiquitous computing technologies mature, they must move out of laboratory settings and into the everyday world. In the process, they will increasingly be used by heterogeneous ...
189
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
193
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Microarray techniques are one of the main methods used to investigate thousands of gene expression profiles for enlightening complex biological processes responsible f...
194
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
156
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...