Sciweavers

1243 search results - page 162 / 249
» Complexity reduction of C-Algorithm
Sort
View
IADIS
2008
15 years 2 months ago
Data Mining Applications in Intelligent Integrated Development Environments
Programming and developing of small scale software applications can be accomplished with simple command-line compilers that can be used to compile, test, and execute code generati...
Ali Farahmand Nejad, Shahabedin Bayati, Sadegh Kha...
APAL
2007
131views more  APAL 2007»
15 years 1 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 1 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CORR
2008
Springer
179views Education» more  CORR 2008»
15 years 1 months ago
Practical Automated Partial Verification of Multi-Paradigm Real-Time Models
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
Carlo A. Furia, Matteo Pradella, Matteo Rossi
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 1 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...