Sciweavers

8496 search results - page 209 / 1700
» Problem Solving and Complex Systems
Sort
View
111
Voted
ATAL
2004
Springer
15 years 7 months ago
Unifying Temporal and Structural Credit Assignment Problems
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the st...
Adrian K. Agogino, Kagan Tumer
120
Voted
COLING
1996
15 years 3 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 1 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
ICASSP
2011
IEEE
14 years 6 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
ER
2007
Springer
173views Database» more  ER 2007»
15 years 8 months ago
Cost-Based Fragmentation for Distributed Complex Value Databases
The major purpose of the design of distributed databases is to improve system performance and to increase system reliability. Fragmentation and allocation play important roles in t...
Hui Ma, Markus Kirchberg