Sciweavers

1171 search results - page 161 / 235
» Variable neighborhood search
Sort
View
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 2 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
CP
2006
Springer
14 years 1 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...
CSCLP
2006
Springer
14 years 1 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ESOP
2006
Springer
14 years 1 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
AIPS
2008
14 years 7 days ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner