1813 search results - page 136 / 363 » Instance Pruning Techniques |
180
click to vote
AI
2007
Springer
16 years 18 days ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
192
click to vote
CP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
169
click to vote
EVOW
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
159
click to vote
CEC
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
159
click to vote
DEXA
2005
Springer
15 years 12 months ago
2005
Springer
In relational database systems a combination of privileges and views is employed to limit a user’s access and to hide non-public data. The data privacy problem is to decide wheth...