Sciweavers

11565 search results - page 98 / 2313
» Computing Minimal Mappings
Sort
View
ENTCS
2002
110views more  ENTCS 2002»
15 years 3 months ago
The Solution Operator of the Korteweg-de Vries Equation is Computable
The initial value problem of the Korteweg-de Vries (KdV) equation posted on the real line R: ut + uux + uxxx = 0, x R, t R u(x, 0) = (x), defines a nonlinear map KR from the ...
Klaus Weihrauch, Ning Zhong 0002
DCC
2010
IEEE
15 years 10 months ago
Optimized Analog Mappings for Distributed Source-Channel Coding
This paper focuses on optimal analog mappings for zero-delay, distributed source-channel coding. The objective is to obtain the optimal vector transformations that map between m-d...
Emrah Akyol, Kenneth Rose, Tor A. Ramstad
SPIN
2007
Springer
15 years 9 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
MEMBRANE
2004
Springer
15 years 9 months ago
Communicative P Systems with Minimal Cooperation
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
Artiom Alhazov, Maurice Margenstern, Vladimir Rogo...
128
Voted
AAAI
2000
15 years 5 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary