3433 search results - page 125 / 687 » Heuristics for a bidding problem |
163
click to vote
ICCBR
2007
Springer
16 years 18 days ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
134
click to vote
ICANN
2005
Springer
15 years 12 months ago
2005
Springer
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
174
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
166
click to vote
ITC
1999
IEEE
15 years 10 months ago
1999
IEEE
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
177
click to vote
NIPS
2007
15 years 7 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...