Sciweavers

17 search results - page 1 / 4
» Dynamic Matching with a Fall-Back Option
Sort
View

Publication
216views
13 years 8 months ago
Dynamic Matching with a Fall-Back Option
We study dynamic matching without money when one side of the market is dynamic with arrivals and de- partures and the other is static and agents have strict prefer- ences over a...
Sujit Gujar, David Parkes

Presentation
383views
13 years 5 months ago
Dynamic Matchings with a Fall-back Option
Presented at 19th European Conference on Artificial Intelligence, Lisbon
LOBJET
2006
127views more  LOBJET 2006»
13 years 3 months ago
A Definition, Overview and Taxonomy of Generic Aspect Languages
ABSTRACT. Aspect-orientation promises better modularity than pure object-oriented decomposition. A typical benefit of increased modularity is ease of maintenance, evolution and reu...
Günter Kniesel, Tobias Rho
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 7 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
SCL
2010
132views more  SCL 2010»
12 years 10 months ago
Convergence in human decision-making dynamics
A class of binary decision-making tasks called the two-alternative forced-choice task has been used extensively in psychology and behavioral economics experiments to investigate h...
Ming Cao, Andrew Reed Stewart, Naomi Ehrich Leonar...