Sciweavers

4103 search results - page 74 / 821
» Some results on the Collatz problem
Sort
View
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
15 years 5 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
TSP
2010
14 years 6 months ago
Sampling from a system-theoretic viewpoint part I: concepts and tools
This paper is first in a series of papers studying a system-theoretic approach to the problem of reconstructing an analog signal from its samples. The idea, borrowed from earlier t...
Gjerrit Meinsma, Leonid Mirkin
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
14 years 9 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
TAMC
2007
Springer
15 years 6 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley