Sciweavers

3335 search results - page 309 / 667
» Grid result checking
Sort
View
DALT
2008
Springer
15 years 8 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
LISA
2003
15 years 8 months ago
Using Service Grammar to Diagnose BGP Configuration Errors
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
Xiaohu Qie, Sanjai Narain
IPL
2002
125views more  IPL 2002»
15 years 6 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
CONCUR
2011
Springer
14 years 6 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
GLOBECOM
2007
IEEE
16 years 1 months ago
A Queued-Code Based on LDPC Block Codes
— A ‘queued-code’ is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Prev...
Satashu Goel, Rohit Negi