Sciweavers

1107 search results - page 178 / 222
» Multi-instance tree learning
Sort
View
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 6 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
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...
Elsa Carvalho, João P. Marques Silva
SDMW
2004
Springer
15 years 6 months ago
Using Secret Sharing for Searching in Encrypted Data
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...
Richard Brinkman, Jeroen Doumen, Willem Jonker
HT
2003
ACM
15 years 6 months ago
The ambient wood journals: replaying the experience
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...
Mark J. Weal, Danius T. Michaelides, Mark K. Thomp...
CPAIOR
2010
Springer
15 years 6 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
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...
Madjid Khichane, Patrick Albert, Christine Solnon
KBSE
2000
IEEE
15 years 5 months ago
Practical Large Scale What-If Queries: Case Studies with Software Risk Assessment
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...
Tim Menzies, Erik Sinsel