Sciweavers

2266 search results - page 168 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ASPDAC
2008
ACM
109views Hardware» more  ASPDAC 2008»
15 years 8 months ago
TCG-based multi-bend bus driven floorplanning
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
Tilen Ma, Evangeline F. Y. Young
ATAL
2010
Springer
15 years 7 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
DAC
1999
ACM
16 years 7 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
CP
2005
Springer
16 years 2 days ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...