Sciweavers

1197 search results - page 127 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CP
2010
Springer
13 years 6 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
JSAC
2008
151views more  JSAC 2008»
13 years 8 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
EUC
2006
Springer
13 years 12 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
WEBI
2010
Springer
13 years 6 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
EELC
2006
121views Languages» more  EELC 2006»
13 years 12 months ago
Symbol Grounding Through Cumulative Learning
Abstract. We suggest that the primary motivation for an agent to construct a symbol-meaning mapping is to solve a task. The meaning space of an agent should be derived from the tas...
Samarth Swarup, Kiran Lakkaraju, Sylvian R. Ray, L...