Sciweavers

211 search results - page 27 / 43
» Solving Games Without Determinization
Sort
View
AI50
2006
15 years 2 months ago
Fifty Years of AI: From Symbols to Embodiment - and Back
There are many stories to tell about the first fifty years of AI. One story is about AI as one of the big forces of innovation in information technology. It is now forgotten that i...
Luc Steels
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 10 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
SIAMAM
2011
14 years 5 months ago
Modeling and Design Optimization of a Resonant Optothermoacoustic Trace Gas Sensor
Trace gas sensors that are compact and portable are being deployed for use in a variety of applications including disease diagnosis via breath analysis, monitoring of atmospheric p...
Noemi Petra, John Zweck, Susan E. Minkoff, Anatoli...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
SIAMCOMP
2011
14 years 5 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio