Sciweavers

3433 search results - page 170 / 687
» Heuristics for a bidding problem
Sort
View
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 12 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
EVOW
2004
Springer
15 years 12 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
SAT
2004
Springer
117views Hardware» more  SAT 2004»
15 years 12 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
15 years 11 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
IJIT
2004
15 years 8 months ago
An Evolutionary Algorithm to Solve Cryptarithmetic Problem
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad...