1107 search results - page 178 / 222 » Multi-instance tree learning |
SAT
2004
Springer
15 years 6 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
112
click to vote
SDMW
2004
Springer
15 years 6 months ago
2004
Springer
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
HT
2003
ACM
15 years 6 months ago
2003
ACM
The Ambient Wood project aims to facilitate a learning experience using an adaptive infrastructure in an outdoor environment. This involves sensor technology, virtual world orches...
113
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
120
click to vote
KBSE
2000
IEEE
15 years 5 months ago
2000
IEEE
When a lack of data inhibits decision making, large scale what-if queries can be conducted over the uncertain parameter ranges. Such what-if queries can generate an overwhelming a...