Sciweavers

1662 search results - page 115 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
BMCBI
2010
110views more  BMCBI 2010»
13 years 10 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
VTC
2008
IEEE
178views Communications» more  VTC 2008»
14 years 4 months ago
Downlink Linear Max-MSE Transceiver Design for Multiuser MIMO Systems Via Dual Decomposition
—This paper addresses the problem of joint linear transceiver design in the downlink of multiuser MIMO systems. We define the performance criterion as minimizing the maximal mea...
Yuanzhang Xiao, Shidong Zhou
IJCAI
1993
13 years 11 months ago
An Approach to Analyzing the Need for Meta-Level Communication
This paper presents an analysis of static and dynamic organizational structures for naturally distributed, homogeneous, cooperative problem solving environments, exemplified by di...
Keith Decker, Victor R. Lesser
IMSCCS
2007
IEEE
14 years 4 months ago
Ensemble Subsurface Modeling Using Grid Computing Technology
Ensemble Kalman Filter (EnKF) uses a randomized ensemble of subsurface models for error and uncertainty estimation. However, the complexity of geological models and the requiremen...
Xin Li, Zhou Lei, Christopher D. White, Gabrielle ...
MOBIHOC
2009
ACM
14 years 10 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang