Sciweavers

1802 search results - page 217 / 361
» Complexity Theory for Operators in Analysis
Sort
View
ATAL
2007
Springer
16 years 18 days ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
NIPS
2007
15 years 7 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
CHI
2002
ACM
16 years 6 months ago
Automating CPM-GOMS
CPM-GOMS is a modeling method that combines the task decomposition of a GOMS analysis with a model of human resource usage at the level of cognitive, perceptual, and motor operati...
Bonnie E. John, Alonso H. Vera, Michael Matessa, M...
OSDI
2004
ACM
16 years 6 months ago
Using Magpie for Request Extraction and Workload Modelling
Tools to understand complex system behaviour are essential for many performance analysis and debugging tasks, yet there are many open research problems in their development. Magpi...
Paul Barham, Austin Donnelly, Rebecca Isaacs, Rich...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 12 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard