Sciweavers

11716 search results - page 283 / 2344
» Computable symbolic dynamics
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
IJFCS
2006
91views more  IJFCS 2006»
15 years 6 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
198
Voted
PERCOM
2010
ACM
15 years 5 months ago
Towards the adaptive integration of multiple context reasoners in pervasive computing environments
Abstract—The pervasive computing vision consists in realizing ubiquitous technologies to support the execution of people’s everyday tasks by proactively providing appropriate i...
Daniele Riboni, Linda Pareschi, Claudio Bettini

Lecture Notes
443views
17 years 4 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
AINA
2007
IEEE
16 years 1 months ago
Pervasive Computing with Frugal Objects
— This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a stron...
Benoît Garbinato, Rachid Guerraoui, Jarle Hu...