4860 search results - page 706 / 972 » SNPs Problems, Complexity, and Algorithms |
156
click to vote
CP
2005
Springer
16 years 3 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
194
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
184
click to vote
PDP
2002
IEEE
15 years 11 months ago
2002
IEEE
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
176
click to vote
SIGGRAPH
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we present a set of efficient image based rendering methods capable of rendering multiple frames per second on a PC. The first method warps Sprites with Depth repr...
170
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...