Sciweavers

513 search results - page 35 / 103
» Finitely Based, Finite Sets of Words
Sort
View
JOTA
2010
104views more  JOTA 2010»
13 years 3 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
MOR
2010
79views more  MOR 2010»
13 years 3 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 3 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
ATS
2003
IEEE
131views Hardware» more  ATS 2003»
14 years 1 months ago
Software-Based Delay Fault Testing of Processor Cores
Software-based self-testing is a promising approach for the testing of processor cores which are embedded inside a System-on-a-Chip (SoC), as it can apply test vectors in function...
Virendra Singh, Michiko Inoue, Kewal K. Saluja, Hi...
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
13 years 8 months ago
An Infinite Antichain of Permutations
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
Daniel A. Spielman, Miklós Bóna