Sciweavers

706 search results - page 76 / 142
» Super Solutions in Constraint Programming
Sort
View
DAC
2007
ACM
16 years 26 days ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
VTC
2008
IEEE
164views Communications» more  VTC 2008»
15 years 6 months ago
Resource Allocation for Downlink Spectrum Sharing in Cognitive Radio Networks
— We consider a resource allocation problem for spectrum sharing in cognitive radio networks. Specifically, we investigate the joint subchannel, rate and power allocation for se...
Patrick Mitran, Long Le, Catherine Rosenberg, Andr...
AI
2010
Springer
14 years 12 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
MP
1998
134views more  MP 1998»
14 years 11 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
PPDP
2005
Springer
15 years 5 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...