Sciweavers

191 search results - page 21 / 39
» Reformulating Constraint Satisfaction Problems to Improve Sc...
Sort
View
APIN
2005
92views more  APIN 2005»
14 years 11 months ago
A Hybrid Neural-Genetic Algorithm for the Frequency Assignment Problem in Satellite Communications
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
Sancho Salcedo-Sanz, Carlos Bousoño-Calz&oa...
EH
2005
IEEE
112views Hardware» more  EH 2005»
15 years 5 months ago
Development Brings Scalability to Hardware Evolution
The scalability problem is a major impediment to the use of hardware evolution for real-world circuit design problems. A potential solution is to model the map between genotype an...
Timothy G. W. Gordon, Peter J. Bentley
CONEXT
2010
ACM
14 years 9 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
MOBIQUITOUS
2005
IEEE
15 years 5 months ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
CP
2004
Springer
15 years 3 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich