Sciweavers

1688 search results - page 24 / 338
» The Complexity of Rationalizing Matchings
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
ARMA Synthesis of Fading Channels- an Application to the Generation of Dynamic MIMO Channels
— Adaptive transceivers play an important role in wireless communications and the design of MIMO systems. Therefore models that enable simulation of dynamic and time varying chan...
Hani Mehrpouyan, Steven D. Blostein
IS
2007
13 years 7 months ago
Matching large schemas: Approaches and evaluation
Current schema matching approaches still have to improve for large and complex Schemas. The large search space increases the likelihood for false matches as well as execution time...
Hong Hai Do, Erhard Rahm
CIKM
2009
Springer
14 years 2 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen