Sciweavers

2624 search results - page 57 / 525
» The 2LIP model and its implementations
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
AAAI
1996
13 years 11 months ago
Generating Multiple New Designs From a Sketch
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
Thomas F. Stahovich, Randall Davis, Howard E. Shro...
MOBICOM
2006
ACM
14 years 3 months ago
Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11e WLANs: test-bed implementation and evaluation
We investigate the optimal selection of minimum contention window values to achieve proportional fairness in a multirate IEEE 802.11e test-bed. Unlike other approaches, the propos...
Vasilios A. Siris, George Stamatakis
SPAA
2010
ACM
14 years 2 months ago
Implementing and evaluating nested parallel transactions in software transactional memory
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...
ATAL
2007
Springer
13 years 11 months ago
Social comparison in crowds: a short report
Modeling crowd behavior is an important challenge for cognitive modelers. We propose a novel model of crowd behavior, based on Festinger’s Social Comparison Theory, a social psy...
Gal A. Kaminka, Natalie Fridman