Sciweavers

3818 search results - page 264 / 764
» Word Problems on Compressed Words
Sort
View
JOTA
2010
104views more  JOTA 2010»
15 years 1 months ago
Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
X. Q. Yang, N. D. Yen
SEMWEB
2007
Springer
16 years 21 days ago
Solving Semantic Ambiguity to Improve Semantic Web based Ontology Matching
A new paradigm in Semantic Web research focuses on the development of a new generation of knowledge-based problem solvers, which can exploit the massive amounts of formally speciï¬...
Jorge Gracia, Vanessa Lopez, Mathieu d'Aquin, Mart...
FOSSACS
2011
Springer
14 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 6 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist