Sciweavers

4103 search results - page 18 / 821
» Some results on the Collatz problem
Sort
View
STTT
2010
120views more  STTT 2010»
13 years 2 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 1 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
HCI
2007
13 years 8 months ago
On Some Aspects of Improving Mobile Applications for the Elderly
Improving the quality of life of elderly people is an emerging issue within our information society for both research and development. This paper addresses some issues on the devel...
Andreas Holzinger, Gig Searle, Alexander K. Nische...
IWPEC
2009
Springer
14 years 1 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
14 years 1 months ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor