Sciweavers

470 search results - page 66 / 94
» Tabu Search for SAT
Sort
View
AAAI
2007
13 years 10 months ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce
HM
2005
Springer
140views Optimization» more  HM 2005»
14 years 1 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
AE
2003
Springer
14 years 28 days ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
14 years 27 days 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
ISQED
2002
IEEE
83views Hardware» more  ISQED 2002»
14 years 18 days ago
A Hybrid BIST Architecture and Its Optimization for SoC Testing
This paper presents a hybrid BIST architecture and methods for optimizing it to test systems-on-chip in a cost effective way. The proposed self-test architecture can be implemente...
Gert Jervan, Zebo Peng, Raimund Ubar, Helena Kruus