Sciweavers

5595 search results - page 761 / 1119
» Comparing Subsumption Optimizations
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 7 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
ECCC
2006
88views more  ECCC 2006»
15 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 7 months ago
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
Rui Zhang, Ying-Chang Liang
JSAC
2008
151views more  JSAC 2008»
15 years 7 months ago
Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio Networks
A cognitive radio (CR) network is often described as a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multi...
Lan Zhang, Ying-Chang Liang, Yan Xin
JPDC
2006
148views more  JPDC 2006»
15 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...