Sciweavers

99 search results - page 6 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
CP
2007
Springer
14 years 2 months ago
Encodings of the Sequence Constraint
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
Sebastian Brand, Nina Narodytska, Claude-Guy Quimp...
TIT
2010
111views Education» more  TIT 2010»
13 years 3 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
TIT
2010
150views Education» more  TIT 2010»
13 years 3 months ago
Information-theoretic key agreement of multiple terminals: part I
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...
Amin Aminzadeh Gohari, Venkat Anantharam
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
SOCO
2010
Springer
13 years 3 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...