Sciweavers

9842 search results - page 256 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PDPTA
2000
15 years 1 months ago
A Reusable Software Framework for Distributed Decision-Making Protocols
Developers of programs for distributed systems spend considerable time designing solutions to various complex decision-making problems. The work described in this paper applies th...
Sudharshan Vazhkudai, H. Conrad Cunningham
90
Voted
CI
1998
82views more  CI 1998»
15 years 8 days ago
Perceiving and Reasoning about a Changing World
A rational agent (artificial or otherwise) residing in a complex changing environment must gather information perceptually, update that information as the world changes, and combi...
John L. Pollock
95
Voted
JMLR
2010
109views more  JMLR 2010»
14 years 7 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
97
Voted
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 7 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
AGI
2011
14 years 4 months ago
Reinforcement Learning and the Bayesian Control Rule
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
Pedro Alejandro Ortega, Daniel Alexander Braun, Si...