Sciweavers

14158 search results - page 366 / 2832
» Generalized switch-setting problems
Sort
View
MEMICS
2010
14 years 11 months ago
On Reliability and Refutability in Nonconstructive Identification
Identification in the limit, originally due to Gold [10], is a widely used computation model for inductive inference and human language acquisition. We consider a nonconstructive ...
Ilja Kucevalovs
149
Voted
COMSNETS
2012
176views more  COMSNETS 2012»
14 years 17 days ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
KBS
2007
56views more  KBS 2007»
15 years 4 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
123
Voted
DCC
2006
IEEE
16 years 4 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao
DSS
2002
97views more  DSS 2002»
15 years 4 months ago
A new paradigm for computer-based decision support
We identify and address a fundamental general problem which we regard as crucial for the widespread, effective use of decision support systems (DSS) in the future: how can we subs...
Meurig Beynon, Suwanna Rasmequan, Steve Russ