Sciweavers

5624 search results - page 213 / 1125
» On Conditional Covering Problem
Sort
View
AAAI
2000
15 years 8 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
Tomás Feder, Pavol Hell, David G. Schell, J...
ICML
2009
IEEE
16 years 7 months ago
A least squares formulation for a class of generalized eigenvalue problems in machine learning
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...
Liang Sun, Shuiwang Ji, Jieping Ye
FGR
2002
IEEE
161views Biometrics» more  FGR 2002»
15 years 11 months ago
Baseline Results for the Challenge Problem of Human ID Using Gait Analysis
Identification of people from gait captured on video has become a challenge problem in computer vision. However, there is not a baseline algorithm or standard dataset for measuri...
P. Jonathon Phillips, Patrick Grother, Sudeep Sark...
ATAL
2000
Springer
15 years 11 months ago
Optimistic and Disjunctive Agent Design Problems
Abstract. The agent design problem is as follows: Given an environment, together with a specification of a task, is it possible to construct an agent that will guarantee to succes...
Michael Wooldridge, Paul E. Dunne