Sciweavers

3415 search results - page 340 / 683
» Lower bounds on kernelization
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 4 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
VMCAI
2010
Springer
16 years 4 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
ATAL
2009
Springer
16 years 1 months ago
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
Valentin Goranko, Dmitry Shkatov