Sciweavers

808 search results - page 73 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
AAAI
2010
14 years 11 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
FLAIRS
2003
14 years 11 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
PRICAI
2004
Springer
15 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
ATAL
2003
Springer
15 years 3 months ago
Performance models for large scale multiagent systems: using distributed POMDP building blocks
Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of co...
Hyuckchul Jung, Milind Tambe