Sciweavers

3238 search results - page 165 / 648
» On the Computational Interpretation of Negation
Sort
View
AUTOMATICA
2010
96views more  AUTOMATICA 2010»
15 years 6 months ago
Frequency domain iterative feedforward/feedback tuning for MIMO ANVC
: A new iterative feedback/feedforward tuning (IFFT) method is presented for multiple-input multiple output (MIMO) control systems that relies on efficient computation of the negat...
Jian Luo, Sandor M. Veres
COLING
2006
15 years 6 months ago
Geometry and Meaning
and logic defined on certain types of abstract spaces and how that intimate relationship might be exploited when applied in computational linguistics. It is also about an approach ...
C. J. van Rijsbergen
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 6 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
TWC
2008
95views more  TWC 2008»
15 years 6 months ago
The Impact of Channel Randomness on Coverage and Connectivity of Ad Hoc and Sensor Networks
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...
Daniele Miorandi
MOC
2002
149views more  MOC 2002»
15 years 6 months ago
Sparse squares of polynomials
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
John Abbott