Sciweavers

808 search results - page 72 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
HM
2007
Springer
120views Optimization» more  HM 2007»
15 years 3 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
AAAI
2006
14 years 11 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
INFOCOM
2011
IEEE
14 years 1 months ago
Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
Mahdi Hajiaghayi, Min Dong, Ben Liang
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 5 days ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...