Sciweavers

2613 search results - page 354 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
KR
1989
Springer
15 years 2 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
COR
2008
95views more  COR 2008»
14 years 10 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
INFOCOM
2010
IEEE
14 years 8 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
ISPD
1997
ACM
110views Hardware» more  ISPD 1997»
15 years 2 months ago
Performance driven global routing for standard cell design
Advances in fabrication technology have resulted in a continual shrinkage of device dimensions. This has resulted in smaller device delays, greater resistance along interconnect w...
Jason Cong, Patrick H. Madden
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 3 months ago
An artificial immune system algorithm for CDMA multiuser detection over multi-path channels
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
Maoguo Gong, Ling Wang, Licheng Jiao, Haifeng Du