Sciweavers

472 search results - page 8 / 95
» Limiting Negations in Formulas
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Team Logic and Second-Order Logic
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
Juha Kontinen, Ville Nurmi
INFOCOM
2005
IEEE
14 years 1 months ago
Optical switching networks with minimum number of limited range wavelength converters
— We study the problem of determining the minimum number of limited range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cr...
Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
ISCAS
2007
IEEE
91views Hardware» more  ISCAS 2007»
14 years 2 months ago
Fundamental Performance Limits in Lossy Polyphase Systems: Apparent Power and Optimal Compensation
— The paper formulates and solves the problem of optimizing power flows in polyphase systems with significant source (line) impedance. We present two fundamental performance bo...
Hanoch Lev-Ari, Alex M. Stankovic
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 8 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki