Sciweavers

949 search results - page 33 / 190
» exact 2008
Sort
View
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
14 years 11 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
14 years 10 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
SCL
2008
95views more  SCL 2008»
14 years 10 months ago
Approximate reduction of dynamic systems
The reduction of dynamic systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically p...
Paulo Tabuada, Aaron D. Ames, A. Agung Julius, Geo...
JC
2008
84views more  JC 2008»
14 years 10 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
DM
2008
116views more  DM 2008»
14 years 10 months ago
Total and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
Riadh Khennoufa, Olivier Togni