Sciweavers

395 search results - page 60 / 79
» Positive Versions of Polynomial Time
Sort
View
AI
2004
Springer
14 years 9 months ago
Efficient learning equilibrium
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
Ronen I. Brafman, Moshe Tennenholtz
JCSS
2010
112views more  JCSS 2010»
14 years 8 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
PVLDB
2010
97views more  PVLDB 2010»
14 years 8 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
JCO
2011
113views more  JCO 2011»
14 years 4 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
JMLR
2010
134views more  JMLR 2010»
14 years 4 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...