Sciweavers

3367 search results - page 101 / 674
» Incremental assignment problem
Sort
View

Publication
208views
15 years 7 months ago
Tolerable Manipulability in Dynamic Assignment without Money
We study a problem of dynamic allocation without money. Agents have arrivals and departures and strict preferences over items. Strategyproofness requires the use of an arriva...
James Zou, Sujit Gujar, and David C. Parkes
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
15 years 2 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
ATAL
2007
Springer
15 years 9 months ago
IFSA: incremental feature-set augmentation for reinforcement learning tasks
Reinforcement learning is a popular and successful framework for many agent-related problems because only limited environmental feedback is necessary for learning. While many algo...
Mazda Ahmadi, Matthew E. Taylor, Peter Stone
DM
2002
82views more  DM 2002»
15 years 2 months ago
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
Frédéric Havet, Janez Zerovnik
ICIP
2003
IEEE
16 years 4 months ago
An integrated algorithm of incremental and robust PCA
Principal Component Analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with nu...
Yongmin Li Li, Li-Qun Xu, Jason Morphett, Richard ...