Sciweavers

1480 search results - page 201 / 296
» Ants can solve constraint satisfaction problems
Sort
View
JSAC
2008
151views more  JSAC 2008»
15 years 6 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
GLOBECOM
2010
IEEE
15 years 4 months ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu
WEBI
2010
Springer
15 years 4 months ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
IANDC
2008
105views more  IANDC 2008»
15 years 6 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...