Sciweavers

3499 search results - page 620 / 700
» On the local optimality of LambdaRank
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 6 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
Abstract—This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence...
Ye Wang, Prakash Ishwar, Venkatesh Saligrama
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 6 months ago
Scaling Laws of Cognitive Networks
—Opportunistic secondary spectrum usage has the potential to dramatically increase spectral efficiency and rates of a network of secondary cognitive users. In this work we consi...
Mai Vu, Natasha Devroye, Masoud Sharif, Vahid Taro...
CSL
2007
Springer
15 years 6 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young