1277 search results - page 225 / 256 » Terminating Decision Algorithms Optimally |
109
click to vote
EOR
2006
15 years 3 months ago
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
152
click to vote
ICCAD
2007
IEEE
15 years 12 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
150
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
111
click to vote
AAAI
2010
15 years 4 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
113
click to vote
CIKM
1999
Springer
15 years 7 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...