Sciweavers

4428 search results - page 152 / 886
» The Chow Parameters Problem
Sort
View
144
Voted
SIAMSC
2011
153views more  SIAMSC 2011»
14 years 10 months ago
Stable Computations with Gaussian Radial Basis Functions
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
Bengt Fornberg, Elisabeth Larsson, Natasha Flyer
CONCUR
2009
Springer
15 years 10 months ago
Reachability in Succinct and Parametric One-Counter Automata
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
Christoph Haase, Stephan Kreutzer, Joël Ouakn...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 9 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
RTSS
1998
IEEE
15 years 8 months ago
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Youn...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 5 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha