Sciweavers

481 search results - page 40 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
INFORMS
2000
54views more  INFORMS 2000»
13 years 8 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
SIAMCO
2010
132views more  SIAMCO 2010»
13 years 3 months ago
Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
Vincent D. Blondel, Julien M. Hendrickx, John N. T...
SPAA
2009
ACM
14 years 5 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
CCS
2006
ACM
14 years 11 days ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
MST
2011
184views Hardware» more  MST 2011»
13 years 3 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks